EUROCRYPT 1986:
Linköping,
Sweden
No formal proceedings of EUROCRYPT 1986 were published.
Informal proceedings:
Ingemar Ingemarsson (Ed.):
Abstracts of Papers:
EUROCRYPT 1986,
A Workshop on the Theory and Application of of Cryptographic Techniques,
20-22 May 1986,
Linköping,
Sweden
- Paul Schöbi:
Perfect Authentication Systems for Data Sources with Arbitrary Statistics.
1-2
- F.-P. Heider, D. Kraus, M. Welschenbach:
Some Preliminary Remarks on the Decimal, Shift an Add-Algorithm (DSA).
3
- Cees J. A. Jansen:
Protection Against Active Eavesdropping.
4-6
- Denis Pinkas:
The Need for a Standarized Compression Algorithm for Digital Signatures.
7
- A. S. Glass:
Could the Smart Card Be Dumb.
8
- Wyn L. Price:
The NPL Intelligent Token and its Application.
10-13
- Viiveke Fåk:
Activities of IFIP Working Group 11: 4 on Crypto Management.
14
- René Peralta, Jeroen van de Graaf:
A Simple an Fast Probabilistic Algorithm for Computing Square Roots Modulo a Prime Number.
15
- Judy H. Moore, Gustavus J. Simmons:
Cycle Structure of the Weak and Semi-Weak DES Keys.
16
- Yvo Desmedt, Frank Hoornaert, Jean-Jacques Quisquater:
Several Exhaustive Key Search Machines and DES.
17-19
- Henri Cloetens, Yvo Desmedt, Luc Bierens, Joos Vandewalle, René Govaerts:
Additional Properties in the S-Boxes of the DES.
20
- Ernest F. Brickell:
Cryptanalysis of the Yagisawa Public Key Cryptosystem.
21-22
- Anne Bauval:
Cryptanalysis of Pseudo-Random Number Sequences Generated by a Linear Recurrence of a Given Order.
23-26
- N. S. James, Rudolf Lidl, Harald Niederreiter:
A Cryptanalytic Attack on the CADE Cryptosystem.
27
- Gur Dial, Franquiberto Pessoa:
Sharma-Mittal Entropy and Shannon's Random Cipher Result.
28
- Gordon B. Agnew:
Another Look at Redundancy in Cryptographic Systems.
29
- Rainer A. Rueppel, Othmar Staffelbach:
Products of Linear Recurring Sequence with Maximum Complexity.
30-32
- Dieter Gollmann:
Linear Complexity of Sequences with Period pn.
33
- Nguyen Quang A:
Elementary Proof of Rueppel's Linear Complexity Conjecture.
34
- Muzhong Wang, James L. Massey:
The Characterization of All Binary Sequences with Perfect Linear Complexity Profiles.
35-36
- Bernhard Smeets:
Some Properties of Sequences Generated by a Windmill Machine.
37
- Tore Herlestam:
On Linear Shift Registers with Permuted Feedback.
38-39
- C. G. Günther:
On Some Properties of the Sum of Two Pseudorandom Sequences.
40-41
- Thomas Siegenthaler:
Correlation-Immune Polynomials over Finite Fields.
42
- Franz Pichler:
On the Walsh-Fourier Analysis of Correlation-Immune Switching Functions.
43-44
- Maurice Beale:
Properties of De Bruijn Sequences Generated by a Cross-Join Technique.
45
- Albrecht Beutelspacher:
Geometric Structures as Threshold Schemes.
46
- A. Ecker:
Tactical Configurations and Threshold Schemes.
47
- Richard A. Kemmerer:
Analyzing Encryption Protocols Using Formal Verification Techniques.
48
- Ove Frank, Per Weidenman:
Controlling Individual Information in Statistics by Coding.
49
- George I. Davida, Yi-Shiung Yeh:
Multilevel Cryptosecure Relational Database.
50
- Winfried B. Müller, Rupert Nöbauer:
On Commutative Semigroups of Polynomials and their Application in Cryptography.
50
- D. D. Buckley, Maurice Beale:
Public Key Encryption of Stream Ciphers.
53-54
- David S. P. Khoo, Gregory J. Bird, Jennifer Seberry:
Encryption Exponent 3 and the Security of RSA.
55
Copyright © Wed Nov 11 01:57:42 2009
by Michael Ley (ley@uni-trier.de)
