Paper 2014/315 Original: eprint.iacr.org/2014/315 ↗

Statistical weaknesses in 20 RC4-like algorithms and (probably) the simplest algorithm free from these weaknesses - VMPC-R

Bartosz Zoltak
Abstract

We find statistical weaknesses in 20 RC4-like algorithms including the original RC4, RC4A, PC-RC4 and others. This is achieved using a simple statistical test. We found only one algorithm which was able to pass the test - VMPC-R. This algorithm, being approximately three times more complex then RC4, is probably the simplest RC4-like cipher capable of producing pseudo-random output.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint.
History
2014-05-05: last updated
2014-05-04: published
Short URL
https://ia.cr/2014/315
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2014/315,
      author = {Bartosz Zoltak},
      title = {Statistical weaknesses in 20 RC4-like algorithms and (probably) the simplest algorithm free from these weaknesses - VMPC-R},
      howpublished = {Cryptology {ePrint} Archive, Paper 2014/315},
      year = {2014},
      url = {https://eprint.iacr.org/2014/315}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.