• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 36 matches

• 1983
• 
  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 [contents]
• 1982
• 
  Leonard M. Adleman:
  Implementing an Electronic Notary Public. CRYPTO 1982: 259-265
• 
  Leonard M. Adleman:
  On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem. CRYPTO 1982: 303-308
• 
  Thomas A. Berson:
  Local Network Cryptosystem Architecture: Access Control. CRYPTO 1982: 251-258
• 
  Thomas A. Berson:
  Long Key Variants of DES. CRYPTO 1982: 311-313
• 
  Rolf Blom:
  Non-Public Key Distribution. CRYPTO 1982: 231-236
• 
  Gilles Brassard:
  On Computationally Secure Authentication Tags Requiring Short Secret Shared Keys. CRYPTO 1982: 79-86
• 
  Ernest F. Brickell:
  A Fast Modular Multiplication Algorithm With Application To Two Key Cryptography. CRYPTO 1982: 51-60
• 
  David Chaum:
  Blind Signatures for Untraceable Payments. CRYPTO 1982: 199-203
• 
  Donald W. Davies:
  Some Regular Properties of the 'Data Encryption Standard' Algorithm. CRYPTO 1982: 89-96
• 
  Shimon Even, Oded Goldreich:
  On the Security of Multi-Party Ping-Pong Protocols. CRYPTO 1982: 315
• 
  Robert R. Jueneman:
  Analysis of Certain Aspects of Output Feedback Mode. CRYPTO 1982: 99-127
• 
  Danny Dolev, Shimon Even, Richard M. Karp:
  On the Security of Ping-Pong Protocols. CRYPTO 1982: 177-186
• 
  Ravi Janardan, K. B. Lakshmanan:
  A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem. CRYPTO 1982: 21-37
• 
  Shimon Even, Oded Goldreich, Abraham Lempel:
  A Randomized Protocol for Signing Contracts. CRYPTO 1982: 205-210
• 
  Luc Longpré:
  The Use of Public-Key Cryptography for Signing Checks. CRYPTO 1982: 187-197
• 
  Michael Merritt:
  Key Reconstruction. CRYPTO 1982: 321-322
• 
  Ernest F. Brickell, Judy H. Moore:
  Some Remarks on the Herlestam-Johannesson Algorithm for Computing Logarithms over GF(2^p). CRYPTO 1982: 15-19
• 
  Carl Nicolai:
  Nondeterministic Cryptography. CRYPTO 1982: 323-326
• 
  Donald W. Davies, Graeme I. P. Parkin:
  The Average Cycle Size of the Key Stream in Output Feedback Encipherment. CRYPTO 1982: 97-98
• 
  Joan B. Plumstead:
  Inferring a Sequence Produced by a Linear Congruence. CRYPTO 1982: 317-319
• 
  Martin E. Hellman, Justin M. Reyneri:
  Fast Computation of Discrete Logarithms in GF(q). CRYPTO 1982: 3-13
• 
  Martin E. Hellman, Justin M. Reyneri:
  Drainage and the DES. CRYPTO 1982: 129-131
• 
  Ronald L. Rivest:
  A Short Report on the RSA Chip. CRYPTO 1982: 327
• 
  Adi Shamir:
  A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem. CRYPTO 1982: 279-288
• 
  Ronald L. Rivest, Alan T. Sherman:
  Randomized Encryption Techniques. CRYPTO 1982: 145-163
• 
  Lenore Blum, Manuel Blum, Mike Shub:
  Comparison of Two Pseudo-Random Number Generators. CRYPTO 1982: 61-78
• 
  Ernest F. Brickell, James A. Davis, Gustavus J. Simmons:
  A Preliminary Report on the Cryptanalysis of Merkle-Hellman Knapsack Cryptosystems. CRYPTO 1982: 289-301
• 
  G. R. Blakley, Laif Swanson:
  Infinite Structures in Information Theory. CRYPTO 1982: 39-50
• 
  G. M. Avis, Stafford E. Tavares:
  Using Data Uncertainty to Increase the Crypto-Complexity of Simple Private Key Enciphering Schemes. CRYPTO 1982: 139-143

skipping 6 more matches