Abstract is missing.
- Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number FieldsDennis Estes, Leonard M. Adleman, Kireeti Kompella, Kevin S. McCurley, Gary L. Miller. 3-13 [doi]
- Another Birthday AttackDon Coppersmith. 14-17 [doi]
- Attacks on Some RSA SignaturesWiebren de Jonge, David Chaum. 18-27 [doi]
- An Attack on a Signature Scheme Proposed by Okamoto and ShiraishiErnest F. Brickell, John M. DeLaurentis. 28-32 [doi]
- A Secure Subliminal Channel (?)Gustavus J. Simmons. 33-41 [doi]
- Unconditionally Secure Authentication Schemes and Practical and Theoretical ConsequencesYvo Desmedt. 42-55 [doi]
- On the Security of Ping-Pong Protocols when Implemented using the RSAShimon Even, Oded Goldreich, Adi Shamir. 58-72 [doi]
- A Secure Poker Protocol that Minimizes the Effect of Player CoalitionsClaude Crépeau. 73-86 [doi]
- A Framework for the Study of Cryptographic ProtocolsRichard Berger, Sampath Kannan, René Peralta. 87-103 [doi]
- Cheating at Mental PokerDon Coppersmith. 104-107 [doi]
- Security for the DoD Transmission Control ProtocolWhitfield Diffie. 108-127 [doi]
- Symmetric Public-Key EncryptionZvi Galil, Stuart Haber, Moti Yung. 128-137 [doi]
- Software Protection: Myth or Reality?James R. Gosler. 140-157 [doi]
- Public Protection of SoftwareAmir Herzberg, Shlomit S. Pinter. 158-179 [doi]
- Fingerprinting Long Forgiving MessagesG. R. Blakley, Catherine Meadows, George B. Purdy. 180-189 [doi]
- Crytanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block CiphersDavid Chaum, Jan-Hendrik Evertse. 192-211 [doi]
- Is DES a Pure Cipher? (Results of More Cycling Experiments on DES)Burton S. Kaliski Jr., Ronald L. Rivest, Alan T. Sherman. 212-226 [doi]
- A Layered Approach to the Design of Private Key CryptosystemsT. E. Moore, Stafford E. Tavares. 227-245 [doi]
- Lifetimes of Keys in Cryptographic Key Management SystemsEiji Okamoto, K. Nakamura. 246-259 [doi]
- Correlation Immunity and the Summation GeneratorRainer A. Rueppel. 260-272 [doi]
- Design of Combiners to Prevent Divide and Conquer AttacksThomas Siegenthaler. 273-279 [doi]
- On the Security of DESAdi Shamir. 280-281 [doi]
- Information Theory Without the Finiteness Assumption, II: Unfolding the DESG. R. Blakley. 282-337 [doi]
- Analysis of a Public Key Approach Based on Polynomial SubstitutionHarriet J. Fell, Whitfield Diffie. 340-349 [doi]
- Developing an RSA ChipMartin Kochanski. 350-357 [doi]
- An M³ Public-Key Encryption SchemeHugh C. Williams. 358-368 [doi]
- Trapdoor Rings and Their Use in CryptographyVijay Varadharajan. 369-395 [doi]
- On Computing Logarithms Over Finite FieldsTaher El Gamal. 396-402 [doi]
- On Using RSA with Low Exponent in a Public Key NetworkJohan Håstad. 403-408 [doi]
- Lenstra s Factorization Method Based on Elliptic CurvesN. M. Stephens. 409-416 [doi]
- Use of Elliptic Curves in CryptographyVictor S. Miller. 417-426 [doi]
- Cryptography with Cellular AutomataStephen Wolfram. 429-432 [doi]
- Efficient Parallel Pseudo-Random Number GenerationJohn H. Reif, J. D. Tygar. 433-446 [doi]
- How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract)Michael Luby, Charles Rackoff. 447 [doi]
- The Bit Security of Modular Squaring Given Partial Factorization of the ModulosBenny Chor, Oded Goldreich, Shafi Goldwasser. 448-457 [doi]
- Some Cryptographic Aspects of WomcodesPhilippe Godlewski, Gérard D. Cohen. 458-467 [doi]
- How to Reduce Your Enemy s Information (Extended Abstract)Charles H. Bennett, Gilles Brassard, Jean-Marc Robert. 468-476 [doi]
- Encrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him?Joan Feigenbaum. 477-488 [doi]
- Divergence Bounds on Key Equivocation and Error Probability in CryptanalysisJohan van Tilburg, Dick E. Boekee. 489-513 [doi]
- A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm SchemesYvo Desmedt, Andrew M. Odlyzko. 516-522 [doi]
- On the Design of S-BoxesA. F. Webster, Stafford E. Tavares. 523-534 [doi]
- The Real Reason for Rivest s PhenomenonDon Coppersmith. 535-536 [doi]
- The Importance of Good Key Scheduling Schemes (How to Make a Secure DES Scheme with <= 48 Bit Keys)Jean-Jacques Quisquater, Yvo Desmedt, Marc Davio. 537-542 [doi]
- Access Control at the Netherlands Postal and Telecommunications ServicesWillem H. Haemers. 543-544 [doi]