Cryptographers' World
 

CRYPTO 1985


[Sort by page number] [Sort by citations count]

 
Hugh C. Williams, editor, Advances in Cryptology - CRYPTO '85, Santa Barbara, California, USA, August 18-22, 1985, Proceedings. Springer, 1986. ISBN 3-540-16463-4.
[Papers]

Find this book on amazon.com , amazon.co.uk, amazon.ca, amazon.de, amazon.fr, Google Books or Wikipedia.



Dennis Estes,  Leonard M. Adleman,  Kireeti Kompella,  Kevin S. McCurley,  Gary L. Miller,  Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields, pp. 3 - 13, CRYPTO 1985.

[Electronic Edition][Cited 18 times ]

Don Coppersmith,  Another Birthday Attack, pp. 14 - 17, CRYPTO 1985.

[Electronic Edition][Cited 51 times Red Star]

Wiebren de Jonge,  David Chaum,  Attacks on Some RSA Signatures, pp. 18 - 27, CRYPTO 1985.

[Electronic Edition][Cited 47 times ]

Ernest F. Brickell,  John M. DeLaurentis,  An Attack on a Signature Scheme Proposed by Okamoto and Shiraishi, pp. 28 - 32, CRYPTO 1985.

[Electronic Edition][Cited 28 times ]

Gustavus J. Simmons,  A Secure Subliminal Channel (?), pp. 33 - 41, CRYPTO 1985.

[Electronic Edition][Cited 39 times ]

Yvo Desmedt,  Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences, pp. 42 - 55, CRYPTO 1985.

[Electronic Edition][Cited 13 times ]

Shimon Even,  Oded Goldreich,  Adi Shamir,  On the Security of Ping-Pong Protocols when Implemented using the RSA, pp. 58 - 72, CRYPTO 1985.

[Electronic Edition][Cited 28 times ]

Claude Crépeau,  A Secure Poker Protocol that Minimizes the Effect of Player Coalitions, pp. 73 - 86, CRYPTO 1985.

[Electronic Edition][Cited 46 times ]

Richard Berger,  Sampath Kannan,  René Peralta,  A Framework for the Study of Cryptographic Protocols, pp. 87 - 103, CRYPTO 1985.

[Electronic Edition][Cited 9 times ]

Don Coppersmith,  Cheating at Mental Poker, pp. 104 - 107, CRYPTO 1985.

[Electronic Edition][Cited 23 times ]

Whitfield Diffie,  Security for the DoD Transmission Control Protocol, pp. 108 - 127, CRYPTO 1985.

[Electronic Edition][Cited 7 times ]

Zvi Galil,  Stuart Haber,  Moti Yung,  Symmetric Public-Key Encryption, pp. 128 - 137, CRYPTO 1985.

[Electronic Edition][Cited 18 times ]

James R. Gosler,  Software Protection: Myth or Reality?, pp. 140 - 157, CRYPTO 1985.

[Electronic Edition][Cited 29 times ]

Amir Herzberg,  Shlomit S. Pinter,  Public Protection of Software, pp. 158 - 179, CRYPTO 1985.

[Electronic Edition][Cited 42 times ]

G. R. Blakley,  Catherine Meadows,  George B. Purdy,  Fingerprinting Long Forgiving Messages, pp. 180 - 189, CRYPTO 1985.

[Electronic Edition][Cited 106 times Red StarRed Star]

David Chaum,  Jan-Hendrik Evertse,  Cryptanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers, pp. 192 - 211, CRYPTO 1985.

[Electronic Edition][Cited 64 times Red Star]

Burton S. Kaliski Jr.,  Ronald L. Rivest,  Alan T. Sherman,  Is DES a Pure Cipher? (Results of More Cycling Experiments on DES), pp. 212 - 226, CRYPTO 1985.

[Electronic Edition][Cited 12 times ]

T. E. Moore,  Stafford E. Tavares,  A Layered Approach to the Design of Private Key Cryptosystems, pp. 227 - 245, CRYPTO 1985.

[Electronic Edition][No citation]

Eiji Okamoto,  K. Nakamura,  Lifetimes of Keys in Cryptographic Key Management Systems, pp. 246 - 259, CRYPTO 1985.

[Electronic Edition][No citation]

Rainer A. Rueppel,  Correlation Immunity and the Summation Generator, pp. 260 - 272, CRYPTO 1985.

[Electronic Edition][Cited 74 times Red Star]

Thomas Siegenthaler,  Design of Combiners to Prevent Divide and Conquer Attacks, pp. 273 - 279, CRYPTO 1985.

[Electronic Edition][Cited 10 times ]

Adi Shamir,  On the Security of DES, pp. 280 - 281, CRYPTO 1985.

[Electronic Edition][Cited 44 times ]

G. R. Blakley,  Information Theory Without the Finiteness Assumption, II: Unfolding the DES, pp. 282 - 337, CRYPTO 1985.

[Electronic Edition][Cited 3 times ]

Harriet J. Fell,  Whitfield Diffie,  Analysis of a Public Key Approach Based on Polynomial Substitution, pp. 340 - 349, CRYPTO 1985.

[Electronic Edition][Cited 47 times ]

Martin Kochanski,  Developing an RSA Chip, pp. 350 - 357, CRYPTO 1985.

[Electronic Edition][Cited 17 times ]

Hugh C. Williams,  An M³ Public-Key Encryption Scheme, pp. 358 - 368, CRYPTO 1985.

[Electronic Edition][Cited 1 times ]

Vijay Varadharajan,  Trapdoor Rings and Their Use in Cryptography, pp. 369 - 395, CRYPTO 1985.

[Electronic Edition][Cited 1 times ]

Taher El Gamal,  On Computing Logarithms Over Finite Fields, pp. 396 - 402, CRYPTO 1985.

[Electronic Edition][No citation]

Johan HÃ¥stad,  On Using RSA with Low Exponent in a Public Key Network, pp. 403 - 408, CRYPTO 1985.

[Electronic Edition][Cited 103 times Red StarRed Star]

N. M. Stephens,  Lenstra's Factorization Method Based on Elliptic Curves, pp. 409 - 416, CRYPTO 1985.

[Electronic Edition][Cited 9 times ]

Victor S. Miller,  Use of Elliptic Curves in Cryptography, pp. 417 - 426, CRYPTO 1985.

[Electronic Edition][Cited 1944 times Red StarRed StarRed StarRed StarRed Star]

Stephen Wolfram,  Cryptography with Cellular Automata, pp. 429 - 432, CRYPTO 1985.

[Electronic Edition][Cited 225 times Red StarRed Star]

John H. Reif,  J. D. Tygar,  Efficient Parallel Pseudo-Random Number Generation, pp. 433 - 446, CRYPTO 1985.

[Electronic Edition][Cited 21 times ]

Michael Luby,  Charles Rackoff,  How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract), pp. 447 - 447, CRYPTO 1985.

[Electronic Edition][Cited 102 times Red StarRed Star]

Benny Chor,  Oded Goldreich,  Shafi Goldwasser,  The Bit Security of Modular Squaring Given Partial Factorization of the Modulos, pp. 448 - 457, CRYPTO 1985.

[Electronic Edition][Cited 10 times ]

Philippe Godlewski,  Gérard D. Cohen,  Some Cryptographic Aspects of Womcodes, pp. 458 - 467, CRYPTO 1985.

[Electronic Edition][Cited 5 times ]

Charles H. Bennett,  Gilles Brassard,  Jean-Marc Robert,  How to Reduce Your Enemy's Information (Extended Abstract), pp. 468 - 476, CRYPTO 1985.

[Electronic Edition][Cited 40 times ]

Joan Feigenbaum,  Encrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him?, pp. 477 - 488, CRYPTO 1985.

[Electronic Edition][Cited 56 times Red Star]

Johan van Tilburg,  Dick E. Boekee,  Divergence Bounds on Key Equivocation and Error Probability in Cryptanalysis, pp. 489 - 513, CRYPTO 1985.

[Electronic Edition][Cited 2 times ]

Yvo Desmedt,  Andrew M. Odlyzko,  A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes, pp. 516 - 522, CRYPTO 1985.

[Electronic Edition][Cited 51 times Red Star]

A. F. Webster,  Stafford E. Tavares,  On the Design of S-Boxes, pp. 523 - 534, CRYPTO 1985.

[Electronic Edition][Cited 326 times Red StarRed StarRed Star]

Don Coppersmith,  The Real Reason for Rivest's Phenomenon, pp. 535 - 536, CRYPTO 1985.

[Electronic Edition][Cited 28 times ]

Jean-Jacques Quisquater,  Yvo Desmedt,  Marc Davio,  The Importance of "Good" Key Scheduling Schemes (How to Make a Secure DES Scheme with <= 48 Bit Keys), pp. 537 - 542, CRYPTO 1985.

[Electronic Edition][Cited 9 times ]

Willem H. Haemers,  Access Control at the Netherlands Postal and Telecommunications Services, pp. 543 - 544, CRYPTO 1985.

[Electronic Edition][No citation]



Database status:
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals
Highly Cited...