Publications of CRYPTO 1985

Page	Title
3-13	Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields
14-17	Another Birthday Attack
18-27	Attacks on Some RSA Signatures
28-32	An Attack on a Signature Scheme Proposed by Okamoto and Shiraishi
33-41	A Secure Subliminal Channel (?)
42-55	Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences
58-72	On the Security of Ping-Pong Protocols when Implemented using the RSA
73-86	A Secure Poker Protocol that Minimizes the Effect of Player Coalitions
87-103	A Framework for the Study of Cryptographic Protocols
104-107	Cheating at Mental Poker
108-127	Security for the DoD Transmission Control Protocol
128-137	Symmetric Public-Key Encryption
140-157	Software Protection: Myth or Reality?
158-179	Public Protection of Software
180-189	Fingerprinting Long Forgiving Messages
192-211	Crytanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers
212-226	Is DES a Pure Cipher? (Results of More Cycling Experiments on DES)
227-245	A Layered Approach to the Design of Private Key Cryptosystems
246-259	Lifetimes of Keys in Cryptographic Key Management Systems
260-272	Correlation Immunity and the Summation Generator
273-279	Design of Combiners to Prevent Divide and Conquer Attacks
280-281	On the Security of DES
282-337	Information Theory Without the Finiteness Assumption, II: Unfolding the DES
340-349	Analysis of a Public Key Approach Based on Polynomial Substitution
350-357	Developing an RSA Chip
358-368	An M³ Public-Key Encryption Scheme
369-395	Trapdoor Rings and Their Use in Cryptography
396-402	On Computing Logarithms Over Finite Fields
403-408	On Using RSA with Low Exponent in a Public Key Network
409-416	Lenstra's Factorization Method Based on Elliptic Curves
417-426	Use of Elliptic Curves in Cryptography
429-432	Cryptography with Cellular Automata
433-446	Efficient Parallel Pseudo-Random Number Generation
447	How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract)
448-457	The Bit Security of Modular Squaring Given Partial Factorization of the Modulos
458-467	Some Cryptographic Aspects of Womcodes
468-476	How to Reduce Your Enemy's Information (Extended Abstract)
477-488	Encrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him?
489-513	Divergence Bounds on Key Equivocation and Error Probability in Cryptanalysis
516-522	A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes
523-534	On the Design of S-Boxes
535-536	The Real Reason for Rivest's Phenomenon
537-542	The Importance of "Good" Key Scheduling Schemes (How to Make a Secure DES Scheme with <= 48 Bit Keys)
543-544	Access Control at the Netherlands Postal and Telecommunications Services