Abstract is missing.
- The Transition from Mechanisms to Electronic Computers, 1940 to 1950Donald W. Davies. 1-21
- Cryptanalysis of LOKILars R. Knudsen. 22-35
- Improving Resistance to Differential Cryptanalysis and the Redesign of LOKILawrence Brown, Matthew Kwan, Josef Pieprzyk, Jennifer Seberry. 36-50
- A Method to Estimate the Number of Ciphertext Pairs for Differential CryptanalysisHiroshi Miyano. 51-58
- Construction of DES-like S-boxes Based on Boolean Functions Satisfyieng the SACKwangjo Kim. 59-72
- The Data Base of Selected Permutations (Extended Abstract)Jun-Hui Yang, Zong-Duo Dai, Kencheng Zeng. 73-81
- A Framework for the Design of One-Way Hash Functions Including Cryptanalysis of Damgård s One-Way Function Based on a Cellular AutomatonJoan Daemen, René Govaerts, Joos Vandewalle. 82-96
- How to Construct A Family of Strong One Way PermutationsBabak Sadeghiyan, Yuliang Zheng, Josef Pieprzyk. 97-110
- On Claw Free FamiliesWakaha Ogata, Kaoru Kurosawa. 111-123
- Sibling Intractable Function Families and Their Applications (Extended Abstract)Yuliang Zheng, Thomas Hardjono, Josef Pieprzyk. 124-138
- A Digital Multisignature Scheme Based on the Fiat-Shamir SchemeKazuo Ohta, Tatsuaki Okamoto. 139-148
- A Generalized Secret Sharing Scheme With Cheater DetectionHung-Yu Lin, Lein Harn. 149-158
- Generalized Threshold CryptosystemsChi-Sung Laih, Lein Harn. 159-166
- Feistel Type Authentication CodesReihaneh Safavi-Naini. 170-178
- Research Activities on Cryptology in KoreaMan Y. Rhee. 179-193
- On Necessary and Sufficient Conditions for the Construction of Super Pseudorandom PermutationsBabak Sadeghiyan, Josef Pieprzyk. 194-209
- A Construction of a Cioher From a Single Pseudorandom PermutationShimon Even, Yishay Mansour. 210-224
- Optima Perfect RandomizersJosef Pieprzyk, Babak Sadeghiyan. 225-236
- A General Purpose Technique for Locating Key Scheduling Weakness in DES-like Cryptosystems (Extended Abstract)Matthew Kwan, Josef Pieprzyk. 237-246
- Results of Switching-Closure-Test on FEAL (Extended Abstract)Hikaru Morita, Kazuo Ohta, Shoji Miyaguchi. 247-252
- IC-Cards and Telecommunication ServicesJun-ichi Mizusawa. 253-264
- Cryptanalysis of Several Conference Key Distribution SchemesAtsushi Shimbo, Shin-ichi Kawamura. 265-276
- Revealing Information with Partial Period Correlations (Extended Abstract)Andrew Klapper, Mark Goresky. 277-287
- Extended Majority Voting and Private-Key Algebraic-Code EncryptionsJoost Meijers, Johan van Tilburg. 288-298
- A Secure Analog Speech Scrambler Using the Discrete Cosine TransformBruce Goldburg, Ed Dawson, S. Sridharan. 299-311
- On Oblivious Transfer Protocol and Its Application for the Exchange of SecretsLein Harn, Hung-Yu Lin. 312-320
- 4 Move Perfect ZKIP of Knowledge with No AssumptionTakeshi Saito, Kaoru Kurosawa, Kouichi Sakurai. 321-330
- On the Complexity of Constant Round ZKIP of Possession of KnowledgeToshiya Itoh, Kouichi Sakurai. 331-345
- On the Power of Two-Local Random ReductionsLance Fortnow, Mario Szegedy. 346-351
- A Note On One-Prover, Instance-Hiding Zero-Knowledge Proof SystemsJoan Feigenbaum, Rafail Ostrovsky. 352-359
- An Efficient Zero-Knowledge Scheme for the Discrete Logarithm Based on Smooth NumbersYvo Desmedt, Mike Burmester. 360-367
- An Extensin of Zero-Knowledge Proofs and Its ApplicationsTatsuaki Okamoto. 368-381
- Any Language in IP Has a Divertable ZKIPToshiya Itoh, Kouichi Sakurai, Hiroki Shizuya. 382-396
- A Multi-Purpose Proof System - for Identity and Membership ProofsChaosheng Shu, Tsutomu Matsumoto, Hideki Imai. 397-411
- Formal Verification of Probabilistic Properties in Cryptographic Protocols (Extended Abstract)Marie-Jeanne Toussaint. 412-426
- Cryptography and Machine LearningRonald L. Rivest. 427-439
- Speeding up Prime Number GenerationJørgen Brandt, Ivan Damgård, Peter Landrock. 440-449
- Two Efficient Server-Aided Secret Computation Protocols Based on the Addition SequenceChi-Sung Laih, Sung-Ming Yen, Lein Harn. 450-459
- On Ordinary Elliptic Curve CryptosystemsAtsuko Miyaji. 460-469
- Cryptanalysis of Another Knapsack CryptosystemAntoine Joux, Jacques Stern. 470-476
- Collisions for Schnorr s Hash Function FFT-Hash Presented at Crypto 91Joan Daemen, Antoon Bosselaers, René Govaerts, Joos Vandewalle. 477-480
- On NIST s Proposed Digital Signature StandardRonald L. Rivest. 481-484
- A Known-Plaintext Attack of FEAL-4 Based on the System of Linear Equations on DifferenceToshinobu Kaneko. 485-488
- Simultaneous Attacks in Differential Cryptanalysis (Getting More Pairs Per Encryption)Matthew Kwan. 489-492
- Privacy, Cryptographic Pseudonyms, and The State of HealthStig Fr. Mjølsnes. 493-494
- Limitations of the Even-Mansour ConstructionJoan Daemen. 495-498