Identification of Cryptographically Strong and Weak Pseudorandom Bit Generators

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5352)


Cryptographically strong Psuedo Random Bit Generators (PRBGs) are used extensively for confidentiality of information. If these PRBGs are weak then the security of information is at stack. In this paper we are giving a model which will use confidence interval and multidimentional scaling for their identification. This statistical model can be used to estimate the strength of a new PRBGs.


PRBG BBS generator Geffe generator Feature extraction Confidence Interval Estimation Multidimensional Scaling 


  1. 1.
    Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)CrossRefzbMATHGoogle Scholar
  2. 2.
    Venimadhavan, C.E.: Statistical Techniques for Cryptanalysis and Steganalysis. In: Workshop on steganography, C-DAC, Kolkata (2004)Google Scholar
  3. 3.
    Neter, J., Waserman, W., Whitmal, G.A.: Applied Statistics. Allyn and Bacon, Boston, Sydney, Toronto (1993)Google Scholar
  4. 4.
    Chien, Y.-T.: Interactive pattern recognition. Marcel-Dekker INC, New York (1978)Google Scholar
  5. 5.
    Theodoridis, S., Kautroumbas, K.: Pattern recognition. Academic Press, NY (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  1. 1.Scientific Analysis Group, DRDODelhiIndia

Personalised recommendations