


default search action
EUROCRYPT 1984: Paris, France
- Thomas Beth, Norbert Cot, Ingemar Ingemarsson:

Advances in Cryptology: Proceedings of EUROCRYPT 84, A Workshop on the Theory and Application of of Cryptographic Techniques, Paris, France, April 9-11, 1984, Proceedings. Lecture Notes in Computer Science 209, Springer 1985, ISBN 3-540-16076-0
General Theory, Classical Methods
- G. Ruggiu:

Cryptology and Complexity Theories. 3-9 - Rudolf Lidl:

On Cryptosystems Based on Polynomials and Finite Fields. 10-15 - Josef Pieprzyk

:
Algebraical Structures of Cryptographic Transformations. 16-24 - Sami Harari:

Non-Linear Non-Commutative Functions for Data Integrity. 25-32 - Lawrence H. Ozarow, Aaron D. Wyner:

Wire-Tap Channel II. 33-50 - Andrea Sgarro:

Equivolcations for Homophonic Ciphers. 51-61 - Marc Davio, Yvo Desmedt, Jean-Jacques Quisquater:

Propagation Characteristics of the DES. 62-73 - James L. Massey, Rainer A. Rueppel:

Linear Ciphers and Random Sequence Generators with Multiple Clocks. 74-87 - Thomas Beth, Fred Piper:

The Stop-and-Go Generator. 88-92 - Dieter Gollmann:

Pseudo Random Properties of Cascade Connections of Clock Controlled Shift Registers. 93-98 - Rainer Vogel:

On the Linear Complexity of Cascaded Sequences. 99-109
Public-Key Systems
- Claus-Peter Schnorr, Werner Alexi:

RSA-Bits are 0.5 + epsilon Secure. 113-126 - Oded Goldreich

:
On the Number of Close-and-Equal Pairs of Bits in a String. 127-141 - Philippe Delsarte, Yvo Desmedt, Andrew M. Odlyzko, Philippe Piret:

Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme. 142-149 - R. M. F. Goodman, Anthony J. McAuley:

A New Trapdoor Knapsack Public-Key Cryptosystem. 150-158 - Ronald L. Rivest:

RSA Chips (Past/Present/Future). 159-165
Number Theoretical Papers
- Carl Pomerance:

The Quadratic Sieve Factoring Algorithm. 169-182 - James A. Davis, Diane B. Holdridge, Gustavus J. Simmons:

Status Report on Factoring (At the Sandia National Laboratories). 183-215 - John Gordon:

Strong Primes are Easy to Find. 216-223 - Andrew M. Odlyzko:

Discrete Logarithms in Finite Fields and Their Cryptographic Significance. 224-314
Channels, Networks, Key Distributions, Protocols
- R. W. Jones:

User Functions for the Generation and Distribution of Encipherment Keys. 317-334 - Rolf Blom:

An Optimal Class of Symmetric Key Generation Systems. 335-338 - Ben J. M. Smeets:

On the Use of the Binary Multiplying Channel in a Private Communication System. 339-348 - Gordon B. Agnew:

Secrecy and Privacy in a Local Area Network Environment. 349-363 - Gustavus J. Simmons:

The Subliminal Channel and Digital Signature. 364-378 - Richard Berger, René Peralta

, Tom Tedrick:
A Provably Secure Oblivious Transfer Protocol. 379-386 - Oded Goldreich

:
On Concurrent Identification Protocols. 387-396
Applications
- A. Ecker:

Time-division Multiplexing Scramblers: Selecting Permutations and Testing the Systems. 399-415 - André Bouckaert:

Security of Transportable Computerized Files. 416-425 - Stephen C. Serpell, C. B. Brookson:

Encryption and Key Manaagement for the ECS Satellite Service. 426-436 - Odoardo Brugia, Salvatore Improta, William Wolfowicz:

An Encryption and Authentication Procedure for Telesurveillance Systems. 437-445 - Ingrid Schaumüller-Bichl, Ernst Piller:

A Method of Software Protection Based on the Use of Smart Cards and Cryptographic Techniques. 446-454
Smart Cards
- Jean Goutay:

Smart Card Applications in Security and Data Protection. 459-463 - Yves Giradot:

Bull CP8 Smart Card Uses in Cryptology. 464-469 - H. Groscot:

Estimation of Some Encryption Functions Implemented into Smart Cards. 470-479 - Louis C. Guillou:

Smart Cards and Conditional Access. 480-489

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














