Journal of Cryptology
Table of Contents
- Jump to Volume 1
- Jump to Volume 2
- Jump to Volume 3
- Jump to Volume 4
- Jump to Volume 5
- Jump to Volume 6
- Jump to Volume 7
- Jump to Volume 8
- Jump to Volume 9
- Jump to Volume 10
- Jump to Volume 11
- Jump to Volume 12
- Jump to Volume 13
Volume 1
Volume 1, Number 1, 1988
- Editorial
- E. F. Brickell
- Pages 1-2
- Is the Data Encryption Standard a Group? (Results of Cycling Experiments on DES)
- B. S. Kaliski, R. L. Rivest and A. T. Sherman
- Pages 3-36
- Some Constructions and Bounds for Authentication Codes
- D. R. Stinson
- Pages 37-52
- The Generation of Random Numbers that Are Probably Prime
- P. Beauchemin, G. Brassard, C. Crepeau, C. Goutier and C. Pomerance
- Pages 53-64
- The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability
- D. Chaum
- Pages 65-75
Volume 1, Number 2, 1988
- Zero-Knowledge Proofs of Identity
- U. Feige, A. Fiat and A. Shamir
- Pages 77-94
- A Key Distribution System Equivalent to Factoring
- K. S. McCurley
- Pages 95-105
- A Key-Exchange System Based on Imaginary Quadratic Fields
- J. A. Buchmann and H. C. Williams
- Pages 107-118
- A Construction for Authentication/Secrecy Codes from Certain Combinatorial Designs
- D. R. Stinson
- Pages 119-127
- A Generalization of Hellman's Extension to Shannon's Approach to Cryptography
- P. Beauchemin and G. Brassard
- Pages 129-131
- How to Share a Secret with Cheaters
- M. Tompa and H. Woll
- Pages 133-138
Volume 1, Number 3, 1989
- Hyperelliptic Cryptosystems
- N. Koblitz
- Pages 139-150
- A Study of Password Security
- M. Luby and C. Rackoff
- Pages 151-158
- Fast Correlation Attacks on Certain Stream Ciphers
- W. Meier and O. Staffelbach
- Pages 159-176
- Inferring Sequences Produced by a Linear Congruential Generator Missing Low-Order Bits
- J. F. Boyar
- Pages 177-184
- Linear Ciphers and Spreads
- F. Piper and M. Walker
- Pages 185-188
Volume 2
Volume 2, Number 1, 1990
- Secure Circuit Evaluation
- M. Abadi and J. Feigenbaum
- Pages 1-12
- Probability To Meet in the Middle
- K. Nishimura and M. Sibuya
- Pages 13-22
- The Combinatorics of Authentication and Secrecy Codes
- D. R. Stinson
- Pages 23-49
- A Matrix Key-Distribution Scheme
- Li Gong and D. J. Wheeler
- Pages 51-59
Volume 2, Number 2, 1990
- A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs
- J. F. Boyar, S. A. Kurtz and M. W. Krentel
- Pages 63-76
- A Cartesian Product Construction for Unconditionally Secure Authentication Codes that Permit Arbitration
- G. J. Simmons
- Pages 77-104
- A Combinatorial Approach to Probabilistic Results on the Linear Complexity Profile of Random Sequences
- H. Niedderreiter
- Pages 105-112
Volume 2, Number 3, 1990
- Methods and Instruments for Designing S-Boxes
- R. Forre
- Pages 115-130
- Information-Theoretic Bounds for Authentication Schemes
- M. Walker
- Pages 131-143
- The Cryptanalysis of FEAL-4 with 20 Chosen Plaintexts
- S. Murphy
- Pages 145-154
- Enumerating Boolean Functions of Cryptographic Significance
- C. Mitchell
- Pages 155-170
Volume 3
Volume 3, Number 1, 1990
- Key-Minimal Crytosystems for Unconditional Secrecy
- P. Godlewski and C. Mitchell
- Pages 1-25
- The Structured Design of Cryptographically Good S-Boxes
- C. Adams and S. E. Tavares
- Pages 27-41
- A Fast Software One-Way Hash Function
- R. C. Merkle
- Pages 43-58
Volume 3, Number 2, 1991
- Guest Editor's Introduction
- T. A. Berson and R. A. Rueppel
- Pages 61-62
- An Implementation for a Fast Public-Key Cryptosystem
- G. B. Agnew , R. C. Mullin , I. M. Onyszchuk and S. A. Vanstone
- Pages 63-79
- Applying a Formal Analysis Technique to the CCITT X.509 Strong Two-Way Authentication Protocol
- K. Gaarder and E. Snekkenes
- Pages 81-98
- How to Time-Stamp a Digital Document
- S. Haber and W. S. Stornetta
- Pages 99-111
- Key Processing with Control Vectors
- S. M. Matyas
- Pages 113-136
- CRYPTOPOST (TM) - A Cryptographic Application to Mail Processing
- J. Pastor
- Pages 137-146
Volume 3, Number 3, 1991
- On the Chor-Rivest Knapsack Cryptosystem
- H. W. Lenstra, Jr.
- Pages 149-155
- Efficient, Perfect Polynomial Random Number Generators
- S. Micali and C.-P. Schnorr
- Pages 157-172
- New Bounds and Constructions for Authentication/Secrecy Codes with Splitting
- M. De Soete
- Pages 173-186
- One-Way Permutations on Elliptic Curves
- B. S. Kaliski
- Pages 187-199
- A Generalized Correlation Attack on a Class of Stream Ciphers Based on the Levenshtein Distance
- J. Dj. Golic and M. J. Mihaljevic
- Pages 201-212
Volume 4
Volume 4, Number 1, 1991
- Editorial Introduction
- E. F. Brickell
- Page 1
- Differential Cryptanalysis of DES-like Cryptosystems
- E. Biham and A. Shamir
- Pages 3-72
Volume 4, Number 2, 1991
- Guest Editor's Introduction
- J. Feigenbaum
- Page 73
- Secure Multiparty Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority
- D. Beaver
- Pages 75-122
- On the Classification of Ideal Secret Sharing Schemes
- E. F. Brickell and D. M. Davenport
- Pages 123-134
- Local Randomness in Pseudorandom Sequences
- U. M. Maurer and J. L. Massey
- Pages 135-149
- Bit Commitment Using Pseudorandomness
- M. Naor
- Pages 151-158
Volume 4, Number 3, 1991
- Efficient Signature Generation by Smart Cards
- C.-P. Schnorr
- Pages 161-174
- Secure Implementations of Identification Systems
- S. Bengio, G. Brassard, Y. G. Desmedt, C. Goutier and J.-J. Quisquater
- Pages 175-183
- Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies
- J. F. Boyar, K. Friedl and C. Lund
- Pages 185-206
- Elliptic Curve Implementations of Zero-Knowledge Blobs
- N. Koblitz
- Pages 207-213
Volume 5
Volume 5, Number 1, 1992
- Preface
- I. B. Damgard
- Page 1
- Experimental Quantum Cryptography
- C. H. Bennett, F. Bessette, G. Brassard, L. Salvail and J. Smolin
- Pages 3-28
- An Interactive Identification Scheme Based on Discrete Logarithms and Factoring
- E. F. Brickell and K. S. McCurley
- Pages 29-39
- Which New RSA-Signatures Can be Computed from Certain Given RSA-Signatures?
- J.-H. Evertse and E. van Heyst
- Pages 41-52
- Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher
- U. M. Maurer
- Pages 53-66
- Correlation Properties of Combiners with Memory in Stream Ciphers
- W. Meier and O. Staffelbach
- Pages 67-86
Volume 5, Number 2, 1992
- A Universal Statistical Test for Random Bit Generators
- U. M. Maurer
- Pages 89-105
- Counting Binary Functions with Certain Cryptographic Properties
- S. Lloyd
- Pages 107-131
- Some Remarks on the Security of the Identification Scheme Based on Permuted Kernels
- J. Georgiades
- Pages 133-137
- A Cubic RSA Code Equivalent to Factorization
- J. H. Loxton, D. S. P. Khoo, G. J. Bird and J. Seberry
- Pages 139-150
Volume 5, Number 3, 1992
- Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes
- E. F. Brickell and D. R. Stinson
- Pages 153-166
- Algebraic Properties of Cryptosystem PGM
- S. S Magliveras and N. D. Memon
- Pages 167-183
- Strongly Ideal Secret Sharing Schemes
- S. J. Phillips and N. C. Phillips
- Pages 185-191
- Binary Sequences Derived from ML-Sequences over Rings, I: Periods of Minimal Polynomials
- Zong-Duo Dai
- Pages 193-207
Volume 6
Volume 6, Number 1, 1993
- Editor's Note
- G. Brassard
- Page 1
- Arithmetic Operations in {GF}$(2^m)$
- G. B. Agnew, T. Beth, R. C. Mullin and S. A. Vanstone
- Pages 3-13
- Multiple Assignment Scheme for Sharing Secret
- M. Ito, A. Saio and T. Nishizeki
- Pages 15-20
- A Uniform-Complexity Treatment of Encryption and Zero-Knowledge
- O. Goldreich
- Pages 21-53
- Cascade Ciphers: The Importance of Being First
- U. M. Maurer and J. L. Massey
- Pages 55-61
Volume 6, Number 2, 1993
- On the Communication Complexity of Zero-Knowledge Proofs
- J. F. Boyar, C. Lund and R. Peralta
- Pages 65-85
- Secret Sharing Over Infinite Domains
- B. Chor and E. Kushilevitz
- Pages 87-95
- A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm
- O. Goldreich and E. Kushilevitz
- Pages 97-116
Volume 6, Number 3, 1993
- Universal Tests for Nonuniform Distributions
- A. W. Schrift and A. Shamir
- Pages 119-133
- A Lower Bound on Authentication After Having Observed a Sequence of Messages
- U. Rosenbaum
- Pages 135-156
- On the Size of Shares for Secret Sharing Schemes
- R. M. Capocelli, A. DeSantis, L. Gargano and U. Vaccaro
- Pages 157-167
- Modifications to the Number Field Sieve
- D. Coppersmith
- Pages 169-180
Volume 6, Number 4, 1993
- A Design of a Fast Pipelined Modular Multiplier Based on a Diminished-Radix Algorithm
- G. Orton, L. Peppard and S. E. Tavares
- Pages 183-208
- Elliptic Curve Cryptosystems and Their Implementations
- A. J. Menezes and S. A. Vanstone
- Pages 209-224
- User Impersonation in Key Certification Schemes
- A. K. Lenstra and Y. Yacobi
- Pages 225-232
Volume 7
Volume 7, Number 1, 1994
- Definitions and Properties of Zero-Knowledge Proof Systems
- O. Goldreich and Y. Oren
- Pages 1-32
- The Vulnerability of Geometric Sequences Based on Fields of Odd Characteristic
- A. Klapper
- Pages 33-51
- On the Structure of the Privacy Hierarchy
- B. Chor, M. Gereb-Graus and E. Kushilevitz
- Pages 53-60
- A Weak Cipher that Generates the Symmetric Group
- S. Murphy, K. Paterson and P. Wild
- Pages 61-65
Volume 7, Number 2, 1994
- Proof of Soundness (Integrity) of Cryptographic Protocols
- G. J. Simmons
- Pages 69-77
- Three System for Cryptographic Protocol Analysis
- R. Kemmerer, C. Meadows and J. Millen
- Pages 79-130
Volume 7, Number 3, 1994
- An Analysis of a Class of Algorithms for S-Box Construction
- L. O'Connor
- Pages 133-151
- Functional Inversion and Communication Complexity
- Shang-Hua Teng
- Pages 153-170
- A Key-Exchange Protocol Using Real Quadratic Fields
- R. Scheidler, J. A. Buchmann and H. C. Williams
- Pages 171-199
Volume 7, Number 4, 1994
- Factorizations in the Elementary Abelian p-Group and Their Cryptographic Significance
- Minghua Qu and S. A. Vanstone
- Pages 201-212
- Algebraic Nonlinearity and Its Applications to Cryptography
- L. O'Connor and A. Klapper
- Pages 213-227
- New Types of Cryptanalytic Attacks Using Related Keys
- E. Biham
- Pages 229-246
Volume 8
Volume 8, Number 1, 1995
- Pairs and Triplets of DES S-Boxes
- D. Davies and S. Murphy
- Pages 1-25
- Provable Security Against a Differential Attack
- K. Nyberg and L. R. Knudsen
- Pages 27-37
- Graph Decompositions and Secret Sharing Schemes
- C. Blundo, A. DeSantis, D. R. Stinson and U. Vaccaro
- Pages 39-64
Volume 8, Number 2, 1995
- On the Distribution of Characteristics in Bijective Mappings
- L. O'Connor
- Pages 67-86
- Necessary and Sufficient Condtions for Collision-Free Hashing
- A. Russell
- Pages 87-100
- Short RSA Keys and Their Generation
- S. A. Vanstone and R. J. Zuccherato
- Pages 101-114
Volume 8, Number 3, 1995
- Further Enumerating Boolean Functions of Cryptographic Significance
- Yi Xian Yang and Baoan Guo
- Pages 115-122
- Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters
- U. M. Maurer
- Pages 123-155
- The Cryptanalysis of a Public-Key Implementation of Finite Group Mappings
- S. Blackburn, S. Murphy and J. Stern
- Pages 157-166
- An Infinite Class of Counterexamples to a Conjecture Concerning Nonlinear Resilient Functions
- D. R. Stinson and J. L. Massey
- Pages 167-173
Volume 8, Number 4, 1995
- Information-Theoretic Bounds for Authentication Codes and Block Designs
- Dingyi Pei
- Pages 177-188
- On Key Storage in Secure Networks
- Martin Dyer, Trevor Fenner, Alan Frieze and Andrew Thomason
- Pages 189-200
- Practical and Provably Secure Release of a Secret and Exchange of Signatures
- I. B. Damgard
- Pages 201-222
Volume 9
Volume 9, Number 1, 1996
- Substitution-Permutation Networks Resistant to Differential and Linear Cryptanalysis
- H. M. Heys and S. E. Tavares
- Pages 1-19
- Differential Cryptanalysis of Lucifer
- I. Ben-Aroya and E. Biham
- Pages 21-34
- On-Line/Off-Line Digital Signatures
- S. Even, O. Goldreich and S. Micali
- Pages 35-67
Volume 9, Number 2, 1996
- Bounds on Secret Key Exchange Using a Random Deal of Cards
- M. J. Fischer and R. N. Wright
- Pages 71-99
- A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity
- T. Itoh, M. Hoshi and S. Tsujii
- Pages 101-109
- Correlation Properties of a General Binary Combiner with Memory
- J. Dj. Golic
- Pages 111-126
Volume 9, Number 3, 1996
- Guest Editor's Introduction
- C. Crepeau
- Pages 127--128
- The Power of Preprocessing in Zero-Knowledge Proofs of Knowledge
- A. De Santis and G. Persiano
- Pages 129--148
- Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor Permutation
- M. Bellare and M. Yung
- Pages 149--166
- How to Construct Constant-Round Zero-Knowledge Proof Systems for NP
- O. Goldreich and A. Kahan
- Pages 167--190
- A Secure Protocol for the Oblivious Transfer (Extended Abstract)
- M. J. Fischer, S. Micali and C. Rackoff
- Pages 191--195
Volume 9, Number 4, 1996
- Efficient Cryptographic Schemes Provably as Secure as Subset Sum
- R. Impagliazzo and M. Naor
- Pages 199-216
- Joint Encryption and Message-Efficient Secure Computation
- M. Franklin and S. Haber
- Pages 217-232
- Ideal Secret Sharing Schemes with Multiple Secrets
- W.-A. Jackson, K. M. Martin and C. M. O'Keefe
- Pages 233-250
- Pseudorandom Generators and the Frequency of Simplicity
- Y. Han and L. A. Hemaspaandra
- Pages 251-261
Volume 10
Volume 10, Number 1, 1997
- On Schnorr's Preprocessing for Digital Signature Schemes
- P. de Rooij
- Pages 1--16
- Locally Random Reductions: Improvements and Applications
- D. Beaver, J. Feigenbaum, J. Kilian and P. Rogaway
- Pages 17--36
- A Language-Dependent Cryptographic Primitive
- T. Itoh, Y. Ohta and H. Shizuya
- Pages 37--50
- RIPEMD with Two-Round Compress Function is Not Collision-Free
- H. Dobbertin
- Pages 51--70
- A Chosen Message Attack on Demytko's Elliptic Curve Cryptosystem
- B. S. Kaliski
- Pages 71--72
Volume 10, Number 2, 1997
- Batch RSA
- A. Fiat
- Pages 75--88
- Batch Diffie-Hellman Key Agreement Systems
- Y. Yacobi and M. J. Beller
- Pages 89--96
- Linking Information Reconciliation and Privacy Amplification
- C. Cachin and U. M. Maurer
- Pages 97--110
- Feedback Shift Registers, 2-Adic Span, and Combiners with Memory
- A. Klapper and M. Goresky
- Pages 111-147
Volume 10, Number 3, 1997
- A Construction of a Cipher from a Single Pseudorandom Permutation
- S. Even and Y. Mansour
- Pages 151-162
- On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures
- I. B. Damgard, T. P. Pedersen and B. Pfitzmann
- Pages 163-194
- An Improvement of Davies' Attack on DES
- E. Biham and A. Biryukov
- Pages 195-206
- The Security of the Birational Permutation Signature Schemes
- D. Coppersmith, J. Stern and S. Vaudenay
- Pages 207-221
Volume 10, Number 4, 1997
- The Size of a Share Must Be Large
- L. Csirmaz
- Pages 223-231
- Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities
- D. Coppersmith
- Pages 233-260
- Mutually Trusted Authority-Free Secret Sharing Schemes
- W.-A. Jackson, K.M. Martin and C.M. O'Keefe
- Pages 261-289
Volume 11
Volume 11, Number 1, 1998
- An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions
- J. Kilian and E. Petrank
- Pages 1-27
- A Structural Comparison of the Computational Difficulty of Breaking Discrete Log Cryptosystems
- K. Sakurai and H. Shizuya
- Pages 29-43
- Cryptanalysis of Multiple Modes of Operation
- E. Biham
- Pages 45-58
- Attacks on Fast Double Block Length Hash Functions
- L. R. Knudsen, X. Lai and B. Preneel
- Pages 59-72
Volume 11, Number 2, 1998
- On Matroid Characterization of Ideal Secret Sharing Schemes
- J. Dj. Golic
- Pages 75-86
- Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation
- M. Naor, R. Ostrovsky, R. Venkatesan and M. Yung
- Pages 87-108
- A Public-Key Cryptosystem Using Purely Cubic Fields
- R. Scheidler
- Pages 109-124
- The Black-Box Model for Cryptographic Primitives
- C. P. Schnorr and S. Vaudenay
- Pages 125-140
- The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes-Okamoto-Vanstone Algorithm
- R. Balasubramanian and N. Koblitz
- Pages 141-145
Volume 11, Number 3, 1998
- Zero-Knowledge Authentication Scheme with Secret Key Exchange
- J. Brandt, I. Damgaard, P. Landrock and T. Pedersen
- Pages 147-159
- Lattice Reduction: A Toolbox for the Cryptanalyst
- A. Joux and J. Stern
- Pages 161-185
- An Efficient Existentially Unforgeable Signature Scheme and Its Applications
- C. Dwork and M. Naor
- Pages 187-208
- Two-Key Triple Encryption
- I. Damgaard and L. R. Knudsen
- Pages 209-218
Volume 11, Number 4, 1998
- Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two
- V. Muller
- Pages 219-234
- An Analysis of SAFER
- S. Murphy
- Pages 235-251
- Cryptanalysis of MD4
- H. Dobbertin
- Pages 253-271
- A Software-Optimized Encryption Algorithm
- P. Rogaway and D. Coppersmith
- Pages 273-287
Volume 12
Volume 12, Number 1, 1999
- Parallel Collision Search with Cryptanalytic Applications
- P. C. van Oorschot and M. J. Wiener
- Pages 1-28
- On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited
- M. Naor and O. Reingold
- Pages 29-66
- A Fast Diffie-Hellman Protocol in Genus 2
- N. P. Smart and S. Siksek
- Pages 67-73
Volume 12, Number 2, 1999
- Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver
- S. Halevi
- Pages 77-90
- Bucket Hashing and Its Application to Fast Message Authentication
- P. Rogaway
- Pages 91-116
- Translucent Cryptography - An Alternative to Key Escrow, and Its Implementation via Fractional Oblivious Transfer
- M. Bellare and R. L. Rivest
- Pages 117-140
- Elliptic Curve Cryptosystems over Small Fields of Odd Characteristic
- N. P. Smart
- Pages 141-151
Volume 12, Number 3, 1999
- On a Fallacious Bound for Authentication Codes
- C. Blundo, A. De Santis, K. Kurosawa and W. Ogata
- Pages 155-161
- Cryptanalysis of Triple Modes of Operation
- E. Biham
- Pages 161-184
- How to Stretch Random Functions: The Security of Protected Counter Sums
- D. J. Bernstein
- Pages 185-192
- The Discrete Logarithm Problem on Elliptic Curves of Trace One
- N. P. Smart
- Pages 193-196
- Divertible and Subliminal-Free Zero-Knowledge Proofs for Languages
- M. Burmester, Y. G. Desmedt, T. Itoh, K. Sakurai and H. Shizuya
- Pages 197-223
Volume 12, Number 4, 1999
- Bounds for Key Distribution Patterns
- K. A. S. Quinn
- Pages 227-240
- Chinese Remaindering Based Cryptosystems in the Presence of Faults
- M. Joye, A. K. Lenstra and J.-J. Quisquater
- Pages 241-246
- On the Security of a Practical Identification Scheme
- V. Shoup
- Pages 247-260
- On the Contrast in Visual Cryptography Schemes
- C. Blundo, A. De Santis and D. R. Stinson
- Pages 261-289
Volume 13
Volume 13, Number 1, 2000
- Preface to Special Issue on General Secure Multiparty Computation
- O. Goldreich
- Pages 1-8
- Secure Communication in Minimal Connectivity Models
- M. Franklin and R. N. Wright
- Pages 9-30
- Player Simulation and General Adversary Structures in Perfect Multiparty Computation
- M. Hirt and U. M. Maurer
- Pages 31-60
- Maintaining Authenticated Communication in the Presence of Break-Ins
- R. Canetti, S. Halevi and A. Herzberg
- Pages 61-106
- Randomness vs. Fault-Tolerance
- R. Canetti, E. Kushilevitz, R. Ostrovsky and A. Rosen
- Pages 107-142
- Security and Composition of Multiparty Cryptographic Protocols
- R. Canetti
- Pages 143-202
Volume 13, Number 2, 2000
- Practical Aspects of Quantum Cryptographic Key Distribution
- H. Zbinden, N. Gisin, B. Huttner, A. Muller and W. Tittle
- Pages 207-220
- Stronger Security Proofs for RSA and Rabin Bits
- R. Fischlin and C. P. Schnorr
- Pages 221-245
- Fast Correlation Attacks on the Summation Generator
- J. Dj. Golic, M. Salmasizadeh and E. Dawson
- Pages 245-262
- A New Public-Key Cryptosystem over a Quadratic Order with Quadratic Decryption Time
- S. Paulus and T. Takagi
- Pages 263-272
- Robust and Efficient Sharing of RSA Functions
- R. Gennaro, T. Rabin, S. Jarecki and H. Krawczyk
- Pages 273-300