


default search action
2nd CRYPTO 1982: Santa Barbara, California, USA
- David Chaum, Ronald L. Rivest, Alan T. Sherman:
Advances in Cryptology: Proceedings of CRYPTO '82, Santa Barbara, California, USA, August 23-25, 1982. Plenum Press, New York 1983 - Martin E. Hellman, Justin M. Reyneri:
Fast Computation of Discrete Logarithms in GF(q). 3-13 - Ernest F. Brickell, Judy H. Moore:
Some Remarks on the Herlestam-Johannesson Algorithm for Computing Logarithms over GF(2p). 15-19 - Ravi Janardan, K. B. Lakshmanan:
A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem. 21-37 - G. R. Blakley, Laif Swanson:
Infinite Structures in Information Theory. 39-50 - Ernest F. Brickell:
A Fast Modular Multiplication Algorithm With Application To Two Key Cryptography. 51-60 - Lenore Blum, Manuel Blum, Mike Shub:
Comparison of Two Pseudo-Random Number Generators. 61-78 - Gilles Brassard:
On Computationally Secure Authentication Tags Requiring Short Secret Shared Keys. 79-86 - Donald W. Davies:
Some Regular Properties of the 'Data Encryption Standard' Algorithm. 89-96 - Donald W. Davies, Graeme I. P. Parkin:
The Average Cycle Size of the Key Stream in Output Feedback Encipherment. 97-98 - Robert R. Jueneman:
Analysis of Certain Aspects of Output Feedback Mode. 99-127 - Martin E. Hellman, Justin M. Reyneri:
Drainage and the DES. 129-131 - Robert S. Winternitz:
Security of a Keystream Cipher with Secret Initial Value. 133-137 - G. M. Avis, Stafford E. Tavares:
Using Data Uncertainty to Increase the Crypto-Complexity of Simple Private Key Enciphering Schemes. 139-143 - Ronald L. Rivest, Alan T. Sherman:
Randomized Encryption Techniques. 145-163 - Danny Dolev, Avi Wigderson:
On the Security of Multi-Party Protocols in Distributed Systems. 167-175 - Danny Dolev, Shimon Even, Richard M. Karp:
On the Security of Ping-Pong Protocols. 177-186 - Luc Longpré:
The Use of Public-Key Cryptography for Signing Checks. 187-197 - David Chaum:
Blind Signatures for Untraceable Payments. 199-203 - Shimon Even, Oded Goldreich, Abraham Lempel:
A Randomized Protocol for Signing Contracts. 205-210 - Shafi Goldwasser, Silvio Micali, Andrew Chi-Chih Yao:
On Signatures and Authentication. 211-215 - Christian Müller-Schloer, Neal R. Wagner:
Cryptographic Protection of Personal Data Cards. 219-229 - Rolf Blom:
Non-Public Key Distribution. 231-236 - Selim G. Akl, Peter D. Taylor:
Cryptographic Solution to a Multilevel Security Problem. 237-249 - Thomas A. Berson:
Local Network Cryptosystem Architecture: Access Control. 251-258 - Leonard M. Adleman:
Implementing an Electronic Notary Public. 259-265 - Charles H. Bennett, Gilles Brassard, Seth Breidbart, Stephen Wiesner:
Quantum Cryptography, or Unforgeable Subway Tokens. 267-275 - Adi Shamir:
A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem. 279-288 - Ernest F. Brickell, James A. Davis, Gustavus J. Simmons:
A Preliminary Report on the Cryptanalysis of Merkle-Hellman Knapsack Cryptosystems. 289-301 - Leonard M. Adleman:
On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem. 303-308 - Thomas A. Berson:
Long Key Variants of DES. 311-313 - Shimon Even, Oded Goldreich:
On the Security of Multi-Party Ping-Pong Protocols. 315 - Joan B. Plumstead:
Inferring a Sequence Produced by a Linear Congruence. 317-319 - Michael Merritt:
Key Reconstruction. 321-322 - Carl Nicolai:
Nondeterministic Cryptography. 323-326 - Ronald L. Rivest:
A Short Report on the RSA Chip. 327

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.