Skip to main content

Abstract

This talk is a short overview [This overview is partially based on the paper (Ballet and Rolland, Cryptogr. Commun. 3(4), 189–206, 2011)] on the use of randomness in cryptography. Firstly we give some indications on building and using the randomness and pseudo randomness in a cryptographic context. In the second step, we study more formally the notion of pseudo-random sequence. We introduce the notion of distinguisher and prediction algorithms and we compare these two notions.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

References

  1. Ballet, S., Rolland, R.: A note on yao’s theorem about pseudo-random generators. Cryptogr. Commun. 3(4), 189–206 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  2. Barthélemy, P., Rolland, R., Véron, P.: Cryptographie: principes et mises en œuvre - 2e édition revue et augmentée. Lavoisier (2012)

    Google Scholar 

  3. Goldreich, O.: Modern Cryptography, Probabilistic Proofs and Pseudo-Randomness. Number 17 in Algorithms and Combinatorics. Springer, Berlin (1999)

    Google Scholar 

  4. Luby, M.: Pseudorandomness and Cryptographic Applications. Princeton University Press, Princeton (1996)

    MATH  Google Scholar 

  5. Seznec, A., Sendrier, N.: Havege: a user-level software heuristic for generating empirically strong random numbers. ACM Trans. Model. Comput. Simul. 13(4), 334–346 (2003)

    Article  Google Scholar 

  6. Shoup, V.: Iso/iec fcd, 18033-2–information technology– security techniques–encryption algorithms–part 2: asymmetric ciphers. Technical Report, International Organization for Standardization (2004)

    Google Scholar 

  7. Yao, A.C.: Theory and applications of trapdoor functions. In: Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, pp. 80–91. IEEE Computer Society, Washington, DC, USA (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Robert Rolland .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Rolland, R. (2015). Randomness in Cryptography. In: Daras, N., Rassias, M. (eds) Computation, Cryptography, and Network Security. Springer, Cham. https://doi.org/10.1007/978-3-319-18275-9_20

Download citation

Publish with us

Policies and ethics