Advances in Cryptology : Proceedings of CRYPTO 84
Recently, there has been a lot of interest in provably "good" pseudo-random number generators [lo, 4, 14, 31. These cryptographically secure generators are "good" in the sense that they pass all probabilistic polynomial time statistical tests. However, despite these nice properti...
Gorde:
| Erakunde egilea: | |
|---|---|
| Beste egile batzuk: | , |
| Formatua: | Livre numérique |
| Hizkuntza: | Anglais |
| Argitaratua: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Saila: | Lecture notes in computer science
196 |
| Gaiak: | |
| Sarrera elektronikoa: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Oharra: |
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, proceedings of CRYPTO 84, Workshop on the theory and application of cryptographic techniques, held at the University of California, Santa Barbara, August 19-22, 1984, 1985, Berlin, Springer, 1 vol. (VIII-491 p.), Lecture notes in computer science, 3-540-15658-5 • Advances in Cryptology, Texte imprimé, 9783662177624 |
Aurkibidea:
- Public Key Cryptosystems and Signatures
- A Prototype Encryption System Using Public Key
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- A Public-Key Cryptosystem Based on the Word Problem
- Efficient Signature Schemes Based on Polynomial Equations (preliminary version)
- Identity-Based Cryptosystems and Signature Schemes
- A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)
- Some Public-Key Crypto-Functions as Intractable as Factorization
- Cryptosystems and Other Hard Problems
- Computing Logarithms in GF (2n)
- Wyner s Analog Encryption Scheme: Results of a Simulation
- On Rotation Group and Encryption of Analog Signals
- The History of Book Ciphers
- An Update on Factorization at Sandia National Laboratories
- An LSI Digital Encryption Processor (DEP)
- Efficient hardware and software implementations for the DES
- Efficient hardware implementation of the DES
- A Self-Synchronizing Cascaded Cipher System with Dynamic Control of Error Propagation
- Randomness and Its Concomitants
- Efficient and Secure Pseudo-Random Number Generation (Extended Abstract)
- An LSI Random Number Generator (RNG)
- Generalized Linear Threshold Scheme
- Security of Ramp Schemes
- A Fast Pseudo Random Permutation Generator With Applications to Cryptology
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
- Analysis and Cryptanalysis
- RSA/Rabin least significant bits are secure (Extended Abstract)
- Information Theory without the Finiteness Assumption, I: Cryptosystems as Group-Theoretic Objects
- Cryptanalysis of Adfgvx Encipherment Systems
- Breaking Iterated Knapsacks
- Dependence ofoutput on input in DES: Small avalanche characteristics
- Des has no Per Round Linear Factors
- Protocols and Authentication
- A Message Authenticator Algorithm Suitable for a Mainframe Computer
- Key Management for Secure Electronic Funds Transfer in a Retail Environment
- Authentication Theory/Coding Theory
- New Secret Codes Can Prevent a Computerized Big Brother
- Fair Exchange of Secrets (extended abstract)
- Cryptoprotocols: Subscription to a Public Key, The Secret Blocking and The Multi-Player Mental Poker Game (extended abstract)
- Poker Protocols
- Impromptu Talks
- A Paradoxical Solution to The Signature Problem
- Sequence Complexity as a Test for Cryptographic Systems
- An Update on Quantum Cryptography
- How to Keep a Secret Alive.