Comparison of Random S-Box Generation Methods

Dragan Lambić; Miodrag Živković

Displaying similar documents to “Comparison of Random S-Box Generation Methods”

Product replacement in the Monster.

Holmes, Petra E., Linton, Stephen A., Murray, Scott H. (2003)

Experimental Mathematics

Similarity:

Longest increasing subsequences of random colored permutations.

Borodin, Alexei (1999)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Weak laws of large numbers for arrays of rowwise negatively dependent random variables.

Taylor, R.L., Patterson, R.F., Bozorgnia, A. (2001)

Journal of Applied Mathematics and Stochastic Analysis

Similarity:

Chaotic image encryption design using Tompkins-Paige algorithm.

Borujeni, Shahram Etemadi, Eshghi, Mohammad (2009)

Mathematical Problems in Engineering

Similarity:

Moment inequalities and complete moment convergence.

Sung, Soo Hak (2009)

Journal of Inequalities and Applications [electronic only]

Similarity:

A log-scale limit theorem for one-dimensional random walks in random environments.

Roitershtein, Alexander (2005)

Electronic Communications in Probability [electronic only]

Similarity:

Quenched limits for transient, ballistic, sub-gaussian one-dimensional random walk in random environment

Jonathon Peterson (2009)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

We consider a nearest-neighbor, one-dimensional random walk { } in a random i.i.d. environment, in the regime where the walk is transient with speed >0 and there exists an ∈(1, 2) such that the annealed law of ( − ) converges to a stable law of parameter . Under the quenched law (i.e., conditioned on the environment), we show that no limit laws are possible. In particular we show that there exist sequences...