Skip to search formSkip to main contentSkip to account menu

Random permutation

Known as: Statistical properties of symmetric groups 
A random permutation is a random ordering of a set of objects, that is, a permutation-valued random variable. The use of random permutations is often… 
Wikipedia (opens in a new tab)

Related topics

Related topics

21 relations
AlgorithmBellman–Ford algorithmCircular layoutCoding theory

Broader (1)

Randomness

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2020
Review
2020
Preface
Nowadays, the situation of COVID-19 pandemic is unpredictable around the world. Due to COVID-19 pandemic all over the world… 
2015
2015
Image Encryption using Random Permutation by Different Key Size
Security of information is main aspect in network communication. The information may be in the form of text, voice and multimedia… 
2015
2015
A Robust Watermarking Scheme Based on Maximum Wavelet Coefficient Modification and Optimal Threshold Technique
Digital watermarking has received extensive attention as a new method for copyright protection. This paper proposes a robust… 
2014
2014
Securing Cloud Data in the New Attacker Model
The world just witnessed the surge of a new and powerful attacker, which was able to coerce operators and acquire the necessary… 
2014
2014
Unweighted Stochastic Local Search can be Effective for Random CSP Benchmarks
We present ULSA, a novel stochastic local search algorithm for random binary constraint satisfaction problems (CSP). ULSA is many… 
2010
2010
A Robust Image Hashing Method Based on Zernike Moments
Image hashing maps an image to a short binary sequence representing the image’s characteristics. This paper proposes a new image… 
2009
2009
Statistics of Random Permutations and the Cryptanalysis of Periodic Block Ciphers
Abstract It has been stated many times that a block cipher is “intended to be” computationally indistinguishable from a random… 
2006
2006
Fast Software Encryption, 13th International Workshop, FSE 2006, Graz, Austria, March 15-17, 2006, Revised Selected Papers
We present several attacks against the Achterbahn stream cipher, which was proposed to the eSTREAM competition. We can break the… 
2003
2003
Permutation Generation: Two New Permutation Algorithms
Two completely new algorithms for generating permutations, shift-cursor algorithm and level algorithm, and their efficient… 
1997
1997
Why GAs are Hard to Use
, 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)