On the measurement of the (non)linearity of Costas permutations.
Drakakis, Konstantinos (2010)
Journal of Applied Mathematics
Similarity:
Displaying similar documents to “Chaotic image encryption design using Tompkins-Paige algorithm.”
On the measurement of the (non)linearity of Costas permutations.
Enhanced cryptography by multiple chaotic dynamics.
Chen, Jianyong, Zhou, Junwei, Wong, Kwok-Wo, Ji, Zhen (2011)
Mathematical Problems in Engineering
Similarity:
Growth rates for subclasses of Av(321).
Albert, M.H., Atkinson, M.D., Brignall, R., Ruškuc, N., Smith, Rebecca, West, J. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Comparison of Random S-Box Generation Methods
Dragan Lambić, Miodrag Živković (2013)
Publications de l'Institut Mathématique
Similarity:
Permutations generated by a stack of depth 2 and an infinite stack in series.
Elder, Murray (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Permutation reconstruction.
Smith, Rebecca (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Meaningful share generation for increased number of secrets in visual secret-sharing scheme.
Ulutas, Mustafa (2010)
Mathematical Problems in Engineering
Similarity:
Algorithms. 31. PERMUT. Simple algorithm generating all permutations
Zdeněk Režný, Evžen Kindler (1973)
Aplikace matematiky
Similarity:
Permutation reconstruction from minors.
Raykova, Mariana (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Amplitude suppression and chaos control in epileptic EEG signals.
Majumdar, Kaushik, Myers, Mark H. (2006)
Computational & Mathematical Methods in Medicine
Similarity:
Words over an ordered alphabet and suffix permutations
Jean-Pierre Duval, Arnaud Lefebvre (2002)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Given an ordered alphabet and a permutation, according to the lexicographic order, on the set of suffixes of a word , we present in this article a linear time and space method to determine whether a word has the same permutation on its suffixes. Using this method, we are then also able to build the class of all the words having the same permutation on their suffixes, first of all the smallest one. Finally, we note that this work can lead to a method for generating a Lyndon word randomly...