Skip to main content

Identification of Cryptographically Strong and Weak Pseudorandom Bit Generators

  • Conference paper
  • 1755 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 5352))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)

    Book  MATH  Google Scholar 

  2. Venimadhavan, C.E.: Statistical Techniques for Cryptanalysis and Steganalysis. In: Workshop on steganography, C-DAC, Kolkata (2004)

    Google Scholar 

  3. Neter, J., Waserman, W., Whitmal, G.A.: Applied Statistics. Allyn and Bacon, Boston, Sydney, Toronto (1993)

    Google Scholar 

  4. Chien, Y.-T.: Interactive pattern recognition. Marcel-Dekker INC, New York (1978)

    Google Scholar 

  5. Theodoridis, S., Kautroumbas, K.: Pattern recognition. Academic Press, NY (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Verma, N., Mishra, P.R., Pandey, G. (2008). Identification of Cryptographically Strong and Weak Pseudorandom Bit Generators. In: Sekar, R., Pujari, A.K. (eds) Information Systems Security. ICISS 2008. Lecture Notes in Computer Science, vol 5352. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89862-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89862-7_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89861-0

  • Online ISBN: 978-3-540-89862-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics