Probabilistic Relations for the Solitaire Keystream Generator

  • Marina Pudovkina
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 78)


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.


Solitaire Probabilistic relations 


  1. [1]
    Schneier B., “The Solitaire Encryption Algorithm”,
  2. [2]
    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
  3. [3]
    Pudovkina M., “Weakness in the Key Scheduling Algorithm of the Solitaire Keystream Generator”, SIBCOM-2001, TOMSK. (the paper is being published)Google Scholar
  4. [4]
    Varfolomeev A.A., Zhukov A.E., Pudovkina M., “Analysis of Stream Ciphers’, Moscow, MEPhI, 2000.Google Scholar
  5. [5]
    Crowley P. “Problems with Bruce Schneier “Solitaire””.,
  6. [6]
    Rueppel R.A. “Analysis and Design of Stream Ciphers”, Springer-Verlag, Communications and Control Engineering Series, 1986.Google Scholar
  7. [7]
    Rivest R.L., “The RC4 encryption algorithm”, RSA Data Security, Inc., Mar. 1992Google Scholar
  8. [8]
    R.J. Jenkins, “ISAAC”, Fast Software Encryption-Cambridge 1996, vol. 1039, D. Gollmann ed.. Springer-Verlag.Google Scholar
  9. [9]
    Simeon V. Maltchev and Peter T. Antonov. “The SCOP Stream Cipher”,, Dec. 1997.

Copyright information

© IFIP International Federation for Information Processing 2002

Authors and Affiliations

  • Marina Pudovkina
    • 1
  1. 1.Moscow Engineering Physics InstituteUSSR

Personalised recommendations