Author(s): Dennis Estes, Leonard M. Adleman, Kireeti Kompella, Kevin S. McCurley, Gary L. Miller (auth.), Hugh C. Williams (eds.)
Series: Lecture Notes in Computer Science 218
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1986
Language: English
Pages: 552
Tags: Input/Output and Data Communications;Communications Engineering, Networks
Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields....Pages 3-13
Another Birthday Attack....Pages 14-17
Attacks on Some RSA Signatures....Pages 18-27
An Attack on a Signature Scheme Proposed by Okamoto and Shiraishi....Pages 28-32
A Secure Subliminal Channel (?)....Pages 33-41
Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences....Pages 42-55
On the Security of Ping-Pong Protocols when Implemented using the RSA (Extended Abstract)....Pages 58-72
A Secure Poker Protocol that Minimizes the Effect of Player Coalitions....Pages 73-86
A Framework for the Study of Cryptographic Protocols....Pages 87-103
Cheating at Mental Poker....Pages 104-107
Security for the DoD Transmission Control Protocol....Pages 108-127
Symmetric Public-Key Encryption....Pages 128-137
Software Protection: Myth or Reality?....Pages 140-157
Public Protection of Software....Pages 158-179
Fingerprinting Long Forgiving Messages....Pages 180-189
Cryptanalysis of des with a Reduced Number of Rounds....Pages 192-211
Is DES a Pure Cipher? (Results of More Cycling Experiments on DES) (Preliminary Abstract)....Pages 212-226
A Layered Approach to the Design of Private Key Cryptosystems....Pages 227-245
Lifetimes of Keys in Cryptographic Key Management Systems....Pages 246-259
Correlation Immunity and the Summation Generator....Pages 260-272
Design of Combiners to Prevent Divide and Conquer Attacks....Pages 273-279
On the Security of DES....Pages 280-281
Information theory without the finiteness assumption, II. Unfolding the DES....Pages 282-337
Analysis of a Public Key Approach Based on Polynomial Substitution....Pages 340-349
Developing an RSA Chip....Pages 350-357
An M 3 Public-Key Encryption Scheme....Pages 358-368
Trapdoor Rings And Their Use In Cryptography....Pages 369-395
On Computing Logarithms Over Finite Fields....Pages 396-402
N Using RSA with Low Exponent in a Public Key Network....Pages 403-408
Lenstra’s Factorisation Method Based on Elliptic Curves....Pages 409-416
Use of Elliptic Curves in Cryptography....Pages 417-426
Cryptography with Cellular Automata....Pages 429-432
Efficient Parallel Pseudo-Random Number Generation....Pages 433-446
How to Construct Pseudo-random Permutations from Pseudo-random Functions....Pages 447-447
The Bit Security of Modular Squaring given Partial Factorization of the Modulos....Pages 448-457
Some Cryptographic Aspects of Womcodes....Pages 458-467
How to Reduce your Enemy’s Information (extended abstract)....Pages 468-476
Encrypting Problem Instances....Pages 477-488
Divergence Bounds on Key Equivocation and Error Probability in Cryptanalysis....Pages 489-513
A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes....Pages 516-522
On the Design of S-Boxes....Pages 523-534
The Real Reason for Rivest’s Phenomenon....Pages 535-536
The Importance of “Good” Key Scheduling Schemes (How to Make a Secure DES* Scheme with ≤ 48 Bit Keys?)....Pages 537-542
Access Control at the Netherlands Postal and Telecommunications Services....Pages 543-544
