Randomness in Cryptography

Robert Rolland ()
Additional contact information
Robert Rolland: Université d’Aix-Marseille, Institut de Mathématiques de Marseille

A chapter in Computation, Cryptography, and Network Security, 2015, pp 451-459 from Springer

Abstract: 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.

Keywords: Cryptography; Distinguisher; Prediction; Pseudo-random generator; Ramdomness; Seed; Yao theorem (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-18275-9_20

Ordering information: This item can be ordered from
http://www.springer.com/9783319182759

DOI: 10.1007/978-3-319-18275-9_20

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().