On the impossibility of private key cryptography with weakly random keys

James L. McInnes; Benny Pinkas

doi:10.1007/3-540-38424-3_31

On the impossibility of private key cryptography with weakly random keys

James L. McInnes
, Benny Pinkas

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

39 Scopus citations

Abstract

The properties of weak sources of randomness have been investigated in many contexts and using several models of weakly random behaviour. For two such models, developed by Santha and Vazirani, and Chor and Goldreich, it is known that the output from one such source cannot be “compressed” to produce nearly random bits. At the same time, however, a single source is sufficient to solve problems in the randomized complexity classes BPP and RP. It is natural to ask exactly which tasks can be done using a single, weak source of randomness and which cannot. The present work begins to answer this question by establishing that a single weakly random source of either model cannot be used to obtain a secure “one-time-pad” type of cryptosystem.

Original language	English
Title of host publication	Advances in Cryptology – CRYPTO 1990, Proceedings
Editors	Alfred J. Menezes, Scott A. Vanstone
Publisher	Springer Verlag
Pages	421-435
Number of pages	15
ISBN (Print)	9783540545088
DOIs	https://doi.org/10.1007/3-540-38424-3_31
State	Published - 1991
Externally published	Yes
Event	10th Conference on the Theory and Application of Cryptography, CRYPTO 1990 - Santa Barbara, United States Duration: 11 Aug 1990 → 15 Aug 1990

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	537 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	10th Conference on the Theory and Application of Cryptography, CRYPTO 1990
Country/Territory	United States
City	Santa Barbara
Period	11/08/90 → 15/08/90

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1991.

Funding

*Address: Dept. of Computer Science,University of Toronto, Toronto, Ontario, Canada M5S 1.44 Email: jimm@tneory.~arofiLo.edu ‘Address: Dept. of Computer Science, Technion - Israel Institute of Technology, Haifa 32000 Israel. Email: [email protected]~ne2. Research supported in part by US-Israel BSF grant 88-00282.

Funders	Funder number
US-Israel BSF	88-00282

Access to Document

10.1007/3-540-38424-3_31

Cite this

McInnes, J. L., & Pinkas, B. (1991). On the impossibility of private key cryptography with weakly random keys. In A. J. Menezes, & S. A. Vanstone (Eds.), Advances in Cryptology – CRYPTO 1990, Proceedings (pp. 421-435). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 537 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-38424-3_31

McInnes, James L. ; Pinkas, Benny. / On the impossibility of private key cryptography with weakly random keys. Advances in Cryptology – CRYPTO 1990, Proceedings. editor / Alfred J. Menezes ; Scott A. Vanstone. Springer Verlag, 1991. pp. 421-435 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{09687b1b901b4a8cb45cbd274acfb581,

title = "On the impossibility of private key cryptography with weakly random keys",

abstract = "The properties of weak sources of randomness have been investigated in many contexts and using several models of weakly random behaviour. For two such models, developed by Santha and Vazirani, and Chor and Goldreich, it is known that the output from one such source cannot be “compressed” to produce nearly random bits. At the same time, however, a single source is sufficient to solve problems in the randomized complexity classes BPP and RP. It is natural to ask exactly which tasks can be done using a single, weak source of randomness and which cannot. The present work begins to answer this question by establishing that a single weakly random source of either model cannot be used to obtain a secure “one-time-pad” type of cryptosystem.",

author = "McInnes, \{James L.\} and Benny Pinkas",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1991.; 10th Conference on the Theory and Application of Cryptography, CRYPTO 1990 ; Conference date: 11-08-1990 Through 15-08-1990",

year = "1991",

doi = "10.1007/3-540-38424-3\_31",

language = "אנגלית",

isbn = "9783540545088",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "421--435",

editor = "Menezes, \{Alfred J.\} and Vanstone, \{Scott A.\}",

booktitle = "Advances in Cryptology – CRYPTO 1990, Proceedings",

address = "גרמניה",

}

McInnes, JL & Pinkas, B 1991, On the impossibility of private key cryptography with weakly random keys. in AJ Menezes & SA Vanstone (eds), Advances in Cryptology – CRYPTO 1990, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 537 LNCS, Springer Verlag, pp. 421-435, 10th Conference on the Theory and Application of Cryptography, CRYPTO 1990, Santa Barbara, United States, 11/08/90. https://doi.org/10.1007/3-540-38424-3_31

On the impossibility of private key cryptography with weakly random keys. / McInnes, James L.; Pinkas, Benny.
Advances in Cryptology – CRYPTO 1990, Proceedings. ed. / Alfred J. Menezes; Scott A. Vanstone. Springer Verlag, 1991. p. 421-435 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 537 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On the impossibility of private key cryptography with weakly random keys

AU - McInnes, James L.

AU - Pinkas, Benny

PY - 1991

Y1 - 1991

N2 - The properties of weak sources of randomness have been investigated in many contexts and using several models of weakly random behaviour. For two such models, developed by Santha and Vazirani, and Chor and Goldreich, it is known that the output from one such source cannot be “compressed” to produce nearly random bits. At the same time, however, a single source is sufficient to solve problems in the randomized complexity classes BPP and RP. It is natural to ask exactly which tasks can be done using a single, weak source of randomness and which cannot. The present work begins to answer this question by establishing that a single weakly random source of either model cannot be used to obtain a secure “one-time-pad” type of cryptosystem.

AB - The properties of weak sources of randomness have been investigated in many contexts and using several models of weakly random behaviour. For two such models, developed by Santha and Vazirani, and Chor and Goldreich, it is known that the output from one such source cannot be “compressed” to produce nearly random bits. At the same time, however, a single source is sufficient to solve problems in the randomized complexity classes BPP and RP. It is natural to ask exactly which tasks can be done using a single, weak source of randomness and which cannot. The present work begins to answer this question by establishing that a single weakly random source of either model cannot be used to obtain a secure “one-time-pad” type of cryptosystem.

UR - https://www.scopus.com/pages/publications/84977114496

U2 - 10.1007/3-540-38424-3_31

DO - 10.1007/3-540-38424-3_31

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84977114496

SN - 9783540545088

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 421

EP - 435

BT - Advances in Cryptology – CRYPTO 1990, Proceedings

A2 - Menezes, Alfred J.

A2 - Vanstone, Scott A.

PB - Springer Verlag

T2 - 10th Conference on the Theory and Application of Cryptography, CRYPTO 1990

Y2 - 11 August 1990 through 15 August 1990

ER -

McInnes JL, Pinkas B. On the impossibility of private key cryptography with weakly random keys. In Menezes AJ, Vanstone SA, editors, Advances in Cryptology – CRYPTO 1990, Proceedings. Springer Verlag. 1991. p. 421-435. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-38424-3_31

On the impossibility of private key cryptography with weakly random keys

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this