CRYPTO A*

45 papers

YearTitle / Authors
1986Advances in Cryptology - CRYPTO '85, Santa Barbara, California, USA, August 18-22, 1985, Proceedings
Hugh C. Williams
1985A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes.
Yvo Desmedt, Andrew M. Odlyzko
1985A Framework for the Study of Cryptographic Protocols.
Richard Berger, Sampath Kannan, René Peralta
1985A Layered Approach to the Design of Private Key Cryptosystems.
T. E. Moore, Stafford E. Tavares
1985A Secure Poker Protocol that Minimizes the Effect of Player Coalitions.
Claude Crépeau
1985A Secure Subliminal Channel (?).
Gustavus J. Simmons
1985Access Control at the Netherlands Postal and Telecommunications Services.
Willem H. Haemers
1985An Attack on a Signature Scheme Proposed by Okamoto and Shiraishi.
Ernest F. Brickell, John M. DeLaurentis
1985An M³ Public-Key Encryption Scheme.
Hugh C. Williams
1985Analysis of a Public Key Approach Based on Polynomial Substitution.
Harriet J. Fell, Whitfield Diffie
1985Another Birthday Attack.
Don Coppersmith
1985Attacks on Some RSA Signatures.
Wiebren de Jonge, David Chaum
1985Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields.
Dennis Estes, Leonard M. Adleman, Kireeti Kompella, Kevin S. McCurley, Gary L. Miller
1985Cheating at Mental Poker.
Don Coppersmith
1985Correlation Immunity and the Summation Generator.
Rainer A. Rueppel
1985Cryptography with Cellular Automata.
Stephen Wolfram
1985Crytanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers.
David Chaum, Jan-Hendrik Evertse
1985Design of Combiners to Prevent Divide and Conquer Attacks.
Thomas Siegenthaler
1985Developing an RSA Chip.
Martin Kochanski
1985Divergence Bounds on Key Equivocation and Error Probability in Cryptanalysis.
Johan van Tilburg, Dick E. Boekee
1985Efficient Parallel Pseudo-Random Number Generation.
John H. Reif, J. D. Tygar
1985Encrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him?
Joan Feigenbaum
1985Fingerprinting Long Forgiving Messages.
G. R. Blakley, Catherine Meadows, George B. Purdy
1985How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract).
Michael Luby, Charles Rackoff
1985How to Reduce Your Enemy's Information (Extended Abstract).
Charles H. Bennett, Gilles Brassard, Jean-Marc Robert
1985Information Theory Without the Finiteness Assumption, II: Unfolding the DES.
G. R. Blakley
1985Is DES a Pure Cipher? (Results of More Cycling Experiments on DES).
Burton S. Kaliski Jr., Ronald L. Rivest, Alan T. Sherman
1985Lenstra's Factorization Method Based on Elliptic Curves.
N. M. Stephens
1985Lifetimes of Keys in Cryptographic Key Management Systems.
Eiji Okamoto, K. Nakamura
1985On Computing Logarithms Over Finite Fields.
Taher El Gamal
1985On Using RSA with Low Exponent in a Public Key Network.
Johan Håstad
1985On the Design of S-Boxes.
A. F. Webster, Stafford E. Tavares
1985On the Security of DES.
Adi Shamir
1985On the Security of Ping-Pong Protocols when Implemented using the RSA.
Shimon Even, Oded Goldreich, Adi Shamir
1985Public Protection of Software.
Amir Herzberg, Shlomit S. Pinter
1985Security for the DoD Transmission Control Protocol.
Whitfield Diffie
1985Software Protection: Myth or Reality?
James R. Gosler
1985Some Cryptographic Aspects of Womcodes.
Philippe Godlewski, Gérard D. Cohen
1985Symmetric Public-Key Encryption.
Zvi Galil, Stuart Haber, Moti Yung
1985The Bit Security of Modular Squaring Given Partial Factorization of the Modulos.
Benny Chor, Oded Goldreich, Shafi Goldwasser
1985The Importance of "Good" Key Scheduling Schemes (How to Make a Secure DES Scheme with <= 48 Bit Keys).
Jean-Jacques Quisquater, Yvo Desmedt, Marc Davio
1985The Real Reason for Rivest's Phenomenon.
Don Coppersmith
1985Trapdoor Rings and Their Use in Cryptography.
Vijay Varadharajan
1985Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences.
Yvo Desmedt
1985Use of Elliptic Curves in Cryptography.
Victor S. Miller