Advances in cryptology - EUROCRYPT 91 : [9th] Workshop on the Theory and Application of Cryptographic Techniques, Brighton, UK, April 8 11, 1991 : proceedings
A series of open workshops devoted to modem cryptology began in Santa Barbara, California in 1981 and was followed in 1982 by a European counterpart in Burg Feurstein, Germany. The series has been maintained with summer meetings in Santa Barbara and spring meetings somewhere in Europe. At the 1983 m...
Na minha lista:
| Autor Corporativo: | |
|---|---|
| Outros Autores: | |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado em: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| coleção: | Lecture notes in computer science
547 |
| Assuntos: | |
| Acesso em linha: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Advances in cryptology, EUROCRYPT '91, Workshop on the Theory and Application of Cryptographic Techniques, Brighton, UK, April 8-11, 1991, proceedings, D.W. Davies (ed.), 1991, Berlin, Springer, 1 vol. (XII-556 p.), Lecture notes in computer science, 3-540-54620-0 • Advances in Cryptology EUROCRYPT '91, Texte imprimé, 9783662211458 |
Sumário:
- Cryptanalysis I
- Differential Cryptanalysis of Feal and N-Hash
- Markov Ciphers and Differential Cryptanalysis
- The Knapsack Hash Function proposed at Crypto 89 can be broken
- Cryptanalysis II
- An Improved Low-Density Subset Sum Algorithm
- Cryptanalysis of McEliece s Public-Key Cryptosystem
- On the Security of the Schnorr Scheme using Preprocessing
- Zero Knowledge and Oblivious Transfer
- Broadcast Interactive Proofs
- Direct Zero Knowledge Proofs of Computational Power in Five Rounds
- On the Reversibility of Oblivious Transfer
- Sequences I
- Ziv-Lempel Complexity for Periodic Sequences and its Cryptographic Application
- A Secret Key Cryptosystem by Iterating a Chaotic Map
- Boolean Functions Satisfying Higher Order Propagation Criteria
- Sequences II
- The Maximum Order Complexity of Sequence Ensembles
- The Number of Output Sequences of a Binary Sequence Generator
- Linear Complexity of Periodically Repeated Random Sequences
- Sequences III
- On A Fast Correlation Attack on Certain Stream Ciphers
- Analysis of Pseudo Random Sequences Generated by Cellular Automata
- On Binary Sequences from Recursions modulo 2e Made Non-Linear by the Bit-By-Bit XOR Function
- Signatures
- Weaknesses of Undeniable Signature Schemes
- Distributed Provers with Applications to Undeniable Signatures
- Interactive Bi-Proof Systems and Undeniable Signature Schemes
- Group Signatures
- Theory I
- Enhancing Secrecy by Data Compression: Theoretical and Practical Aspects
- Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation
- Some Considerations concerning the Selection of RSA Moduli
- On the Use of Interconnection Networks in Cryptography
- Theory II
- Non Supersingular Elliptic Curves for Public Key Cryptosystems
- Building CyclicElliptic Curves Modulo Large Primes
- On the Complexity of Hyperelliptic Discrete Logarithm Problem
- S-Box Criteria
- An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks
- Enumerating Nondegenerate Permutations
- Perfect nonlinear S-boxes
- Applications I
- A Formal Approach to Security Architectures
- Discrete Logarithm Based Protocols
- Human Identification Through Insecure Channel
- The Automated Cryptanalysis of Analog Speech Scramblers
- Applications II
- A Construction for One Way Hash Functions and Pseudorandom Bit Generators
- ESIGN: An Efficient Digital Signature Implementation for Smart Cards
- New Approaches to the Design of Self-Synchronizing Stream Ciphers
- Randomized Authentication Systems
- Public Key Cryptography
- Ideals over a Non-Commutative Ring and their Application in Cryptology
- Self-certified public keys
- Non-interactive Public-Key Cryptography
- Short Papers presented at the Rump Session
- Hash Functions And Graphs With Large Girths
- Dickson Pseudoprimes and Primality Testing
- Equivalent Goppa Codes and Trapdoors to McEliece s Public Key Cryptosystem
- A Threshold Cryptosystem without a Trusted Party
- A Comparison of Cryptanalytic Principles Based on Iterative Error-Correction
- Cryptanalysis of the Chaotic-Map Cryptosystem Suggested at EUROCRYPT 91
- How To Broadcast A Secret
- Probabilistic Analysis of Elementary Randomizers
- Race Integrity Primitives Evaluation (RIPE): A status report
- The Information Leakage through a Randomly Generated Function
- Some Weaknesses of Weaknesses of Undeniable Signatures .