Search
International Association for Cryptologic Research
What's new
Archive
Best Papers
Videos
Authors
Coauthors
By year
By conference
All Committees
Most Committees
Report errors
Maps
About
Publications by Conference
Advances in Cryptology: Proceedings of CRYPTO '83
Page
Title
3-23
Knapsack Public Key Cryptosystems and Diophantine Approximation
25-37
Solving Low Density Knapsacks
39-42
Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems
43-50
On the Power of Cascade Ciphers
51-67
The Prisoners' Problem and the Subliminal Channel
71-80
An Overview of Factoring
81-85
New Ideas for Factoring Large Integers
87-102
Factoring Numbers on the Massively Parallel Computer
103-113
Factorization Using the Quadratic Sieve Algorithm
117-131
Signatures through Approximate Representation by Quadratic Forms
133-136
A Simple Protocol for Signing Contracts
137-146
Reducibility Among Protocols
147-151
How to Exchange Half a Bit
153
Blind Signature System
157-170
A Layered Broadcast Cryptographic System
171-202
Analytical Characteristics of the DES
203-207
Producing a One-Way Hash Function from DES
209-230
On the Security of Compressed Encodings
231-247
Field Encryption and Authentication
249
Shift-Register Synthesis (Modula m)
253-273
Probabilistic Analysis and Performance Modelling of the `Swedish' Algorithm and Modifications
275-292
A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p²)
293-301
Permutation Polynomials in RSA-Cryptosystems
303-356
Some Results on the Information Theoretic Analysis of Cryptosystems
359-368
Improving the Security of Exponential Key Exchange
369-375
RSA Bits are 732+epsilon Secure
377-382
Use of the `Signature Token' to Create a Negotiable Document
383-386
Electronic Wallet
387-392
Design Concepts for Tamper Responding Systems