130wde
130wde

Reputation: 49

Secure Shuffle techniques?

Can anyone help me point out known shuffle techniques that are considered secure?

Any paper/technique name reference would help ( I tried to search it up with not decisive results showing)

Appreciate any kind of help

Upvotes: 0

Views: 1933

Answers (1)

Ami Tavory
Ami Tavory

Reputation: 76297

In theory, a perefectly-random implementation of something like the Fisher-Yates algorithm would yield a completely random shuffle. In practice, howerver, Fisher-Yates is susceptible to things like modulo bias. See some of the pitfalls in relevant section in the Wikipedia entry and How Not To Shuffle The Knuth-Fisher-Yates Algorithm.

Knuth's classic The Art Of Computer Programming (Volume 2) - discusses a possibly suitable algorithm by MacLaren and Marsaglia.

Finally, see also Cryptographic Shuffling of Random and Pseudorandom Sequences.

Upvotes: 1

Related Questions