Probabilistic Relations for the Solitaire Keystream Generator
Stream ciphers are often used in applications where high speed and low delay are a requirement. The Solitaire keystream generator was developed by B. Schneier as a paper-and-pencil cipher. Solitaire gets its security from the inherent randomness in a shuffled deck of cards. In this paper we present probabilistic relations for the Solitaire keystream generator and describe their properties.
KeywordsSolitaire Probabilistic relations
- Schneier B., “The Solitaire Encryption Algorithm”, http://www.counterpane.com/solitaire.html.
- Pudovkina M, Varfolomeev A.A. “A Cycle Structure of the Solitaire Keystream Generator”. 3nd International Workshop on Computer Science and Information Technologies CSIT’2001, YFA, 2001.Google Scholar
- Pudovkina M., “Weakness in the Key Scheduling Algorithm of the Solitaire Keystream Generator”, SIBCOM-2001, TOMSK. (the paper is being published)Google Scholar
- Varfolomeev A.A., Zhukov A.E., Pudovkina M., “Analysis of Stream Ciphers’, Moscow, MEPhI, 2000.Google Scholar
- Crowley P. “Problems with Bruce Schneier “Solitaire””., http://www.hedonism.demon.co.uk/paul/solitaire/
- Rueppel R.A. “Analysis and Design of Stream Ciphers”, Springer-Verlag, Communications and Control Engineering Series, 1986.Google Scholar
- Rivest R.L., “The RC4 encryption algorithm”, RSA Data Security, Inc., Mar. 1992Google Scholar
- R.J. Jenkins, “ISAAC”, Fast Software Encryption-Cambridge 1996, vol. 1039, D. Gollmann ed.. Springer-Verlag.Google Scholar
- Simeon V. Maltchev and Peter T. Antonov. “The SCOP Stream Cipher”, ftp://ftp.funet.fi/pub/crypt/cryptography/symmetric/scop/scop.tar.gz, Dec. 1997.