EUROCRYPT A*

55 papers

YearTitle / Authors
1991A Comparison of Cryptanalytic Principles Based on Iterative Error-Correction.
Miodrag J. Mihaljevic, Jovan Dj. Golic
1991A Construction for One Way Hash Functions and Pseudorandom Bit Generators.
Babak Sadeghiyan, Josef Pieprzyk
1991A Formal Approach to Security Architectures.
Rainer A. Rueppel
1991A Secret Key Cryptosystem by Iterating a Chaotic Map.
Toshiki Habutsu, Yoshifumi Nishio, Iwao Sasase, Shinsaku Mori
1991A Threshold Cryptosystem without a Trusted Party (Extended Abstract).
Torben P. Pedersen
1991Advances in Cryptology - EUROCRYPT '91, Workshop on the Theory and Application of of Cryptographic Techniques, Brighton, UK, April 8-11, 1991, Proceedings
Donald W. Davies
1991An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks.
M. H. Dawson, Stafford E. Tavares
1991An Improved Low-Denisty Subset Sum Algorithm.
Matthijs J. Coster, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr
1991Analysis of Pseudo Random Sequence Generated by Cellular Automata.
Willi Meier, Othmar Staffelbach
1991Boolean Functions Satisfying Higher Order Propagation Criteria.
Bart Preneel, René Govaerts, Joos Vandewalle
1991Broadcast Interactive Proofs (Extended Abstract).
Mike Burmester, Yvo Desmedt
1991Building Elliptic Curves Modulo Large Primes.
François Morain
1991Cryptanalysis of McEliece's Public-Key Cryptosystem.
Valery I. Korzhik, Andrew I. Turkin
1991Cryptanalysis of the Chaotic-Map Cryptosystem Suggested at EUROCRYPT'91.
Eli Biham
1991Dickson Pseudoprimes and Primality Testing.
Winfried B. Müller, Alan Oswald
1991Differential Cryptanalysis of Feal and N-Hash.
Eli Biham, Adi Shamir
1991Direct Zero Knowledge Proofs of Computational Power in Five Rounds.
Tatsuaki Okamoto, David Chaum, Kazuo Ohta
1991Discrete Logarithm Based Protocols.
Patrick Horster, Hans-Joachim Knobloch
1991Distributed Provers with Applications to Undeniable Signatures.
Torben P. Pedersen
1991ESIGN: An Efficient Digital Signature Implementation for Smard Cards.
Atsushi Fujioka, Tatsuaki Okamoto, Shoji Miyaguchi
1991Enhancing Secrecy by Data Compression: Theoretical and Practical Aspects.
Colin Boyd
1991Enumerating Nondegenerate Permutations.
Luke O'Connor
1991Equivalent Goppa Codes and Trapdoors to McEliece's Public Key Cryptosystem.
J. K. Gibson
1991Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations.
Claus-Peter Schnorr
1991Group Signatures.
David Chaum, Eugène van Heyst
1991Hash Functions And Graphs With Large Girths.
Gilles Zémor
1991How To Broadcast A Secret.
Shimshon Berkovits
1991Human Identification Through Insecure Channel.
Tsutomu Matsumoto, Hideki Imai
1991Ideals over a Non-Commutative Ring and thier Applications in Cryptology.
Ernst M. Gabidulin, A. V. Paramonov, O. V. Tretjakov
1991Interactive Bi-Proof Systems and Undeniable Signature Schemes.
Atsushi Fujioka, Tatsuaki Okamoto, Kazuo Ohta
1991Linear Complexity of Periodically Repeated Random Sequences.
Zong-Duo Dai, Jun-Hui Yang
1991Liv-Lempel Complexity for Periodic Sequences and its Cryptographic Application.
Sibylle Mund
1991Markov Ciphers and Differential Cryptanalysis.
Xuejia Lai, James L. Massey, Sean Murphy
1991New Approaches to the Design of Self-Synchronizing Stream Ciphers.
Ueli M. Maurer
1991Non Supersingular Elliptic Curves for Public Key Cryptosystems.
Thomas Beth, F. Schaefer
1991Non-interactive Public-Key Cryptography.
Ueli M. Maurer, Yacov Yacobi
1991On A Fast Correlation Attack on Certain Stream Ciphers.
Vladimir V. Chepyzhov, Ben J. M. Smeets
1991On Binary Sequences from Recursions modulo 2
William G. Chambers, Zong-Duo Dai
1991On the Complexity of Hyperelliptic Discrete Logarithm Problem.
Hiroki Shizuya, Toshiya Itoh, Kouichi Sakurai
1991On the Reversibility of Oblivious Transfer.
Claude Crépeau, Miklos Santha
1991On the Security of the Schnorr Scheme using Preprocessing.
Peter de Rooij
1991On the Use of Interconnection Networks in Cryptography.
Michael Portz
1991Perfect Nonlinear S-Boxes.
Kaisa Nyberg
1991Probabilistic Analysis of Elementary Randimizers.
Josef Pieprzyk
1991Race Integrity Primitives Evaluation (RIPE): A Status Report.
Bart Preneel, David Chaum, Walter Fumy, Cees J. A. Jansen, Peter Landrock, Gert Roelofsen
1991Randomized Authentication Systems.
Josef Pieprzyk, Reihaneh Safavi-Naini
1991Self-Certified Public Keys.
Marc Girault
1991Some Considerations concerning the Selection of RSA Moduli.
Klaus Huber
1991Some Weaknesses of "Weaknesses of Undeniable Signatures".
David Chaum
1991The Automated Cryptanalysis of Analog Speech Scramblers.
Bruce Goldburg, Ed Dawson, S. Sridharan
1991The Information Leakage through a Randomly Generated Function.
Lennart Brynielsson
1991The Knapsack Hash Function proposed at Crypto'89 can be broken.
Paul Camion, Jacques Patarin
1991The Maximum Order Complexity of Sequence Ensembles.
Cees J. A. Jansen
1991The Number of Output Sequences of a Binary Sequence Generator.
Jovan Dj. Golic
1991Weakness of Undeniable Signature Schemes (Extended Abstract).
Yvo Desmedt, Moti Yung