Advances in Cryptology — EUROCRYPT ’90 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

48

(FIVE YEARS 0)

H-INDEX

15

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540535874, 9783540468776

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

VICTOR an efficient RSA hardware implementation

Advances in Cryptology — EUROCRYPT ’90 - Lecture Notes in Computer Science ◽

10.1007/3-540-46877-3_22 ◽

1991 ◽

pp. 245-252 ◽

Author(s):

Holger Orup ◽

Erik Svendsen ◽

Erik Andreasen

Keyword(s):

Hardware Implementation

Download Full-text

Factoring with two large primes

Advances in Cryptology — EUROCRYPT ’90 - Lecture Notes in Computer Science ◽

10.1007/3-540-46877-3_7 ◽

1991 ◽

pp. 72-82 ◽

Author(s):

Arjen K. Lenstra ◽

Mark S. Manasse

Download Full-text

Implementation of a Key Exchange Protocol Using Real Quadratic Fields

Advances in Cryptology — EUROCRYPT ’90 - Lecture Notes in Computer Science ◽

10.1007/3-540-46877-3_9 ◽

1991 ◽

pp. 98-109 ◽

Author(s):

Renate Scheidler ◽

Johannes A. Buchmann ◽

Hugh C. Williams

Keyword(s):

Key Exchange ◽

Quadratic Fields ◽

Key Exchange Protocol ◽

Real Quadratic Fields ◽

Download Full-text

On an Implementation of the Mohan-Adiga Algorithm

Advances in Cryptology — EUROCRYPT ’90 - Lecture Notes in Computer Science ◽

10.1007/3-540-46877-3_48 ◽

1991 ◽

pp. 496-500 ◽

Author(s):

Gisela Meister

Download Full-text

On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2

Advances in Cryptology — EUROCRYPT ’90 - Lecture Notes in Computer Science ◽

10.1007/3-540-46877-3_27 ◽

1991 ◽

pp. 306-312 ◽

Author(s):

Ben Smeets ◽

Peter Vanroose ◽

Zhe-xian Wan

Keyword(s):

Authentication Codes

Download Full-text

Lower Bounds for the Linear Complexity of Sequences over Residue Rings

Advances in Cryptology — EUROCRYPT ’90 - Lecture Notes in Computer Science ◽

10.1007/3-540-46877-3_16 ◽

1991 ◽

pp. 189-195 ◽

Author(s):

Zong-duo Dai ◽

Thomas Beth ◽

Dieter Gollmann

Keyword(s):

Lower Bounds ◽

Linear Complexity

Download Full-text

All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments Under Cryptographic Assumptions

Advances in Cryptology — EUROCRYPT ’90 - Lecture Notes in Computer Science ◽

10.1007/3-540-46877-3_1 ◽

1991 ◽

pp. 1-10 ◽

Author(s):

Mike V. D. Burmester ◽

Yvo Desmedt

Keyword(s):

Zero Knowledge ◽

Cryptographic Assumptions

Download Full-text

Confirmation that Some Hash Functions Are Not Collision Free

Advances in Cryptology — EUROCRYPT ’90 - Lecture Notes in Computer Science ◽

10.1007/3-540-46877-3_30 ◽

1991 ◽

pp. 326-343 ◽

Author(s):

Shoji Miyaguchi ◽

Kazuo Ohta ◽

Masahiko Iwata

Keyword(s):

Download Full-text

Public-Randomness in Public-Key Cryptography

Advances in Cryptology — EUROCRYPT ’90 - Lecture Notes in Computer Science ◽

10.1007/3-540-46877-3_5 ◽

1991 ◽

pp. 46-62 ◽

Author(s):

Alfredo De Santis ◽

Giuseppe Persiano

Keyword(s):

Public Key Cryptography ◽

Download Full-text

Provably Secure Key-Updating Schemes in Identity-Based Systems

Advances in Cryptology — EUROCRYPT ’90 - Lecture Notes in Computer Science ◽

10.1007/3-540-46877-3_3 ◽

1991 ◽

pp. 16-30 ◽

Author(s):

S. Shinozaki ◽

T. Itoh ◽

A. Fujioka ◽

S. Tsujii

Keyword(s):

Identity Based ◽

Provably Secure

Download Full-text