Advances in Cryptology - CRYPTO 2003 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540406747, 9783540451464

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Algebraic Attacks on Combiners with Memory

Advances in Cryptology - CRYPTO 2003 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45146-4_10 ◽

2003 ◽

pp. 162-175 ◽

Cited By ~ 88

Author(s):

Frederik Armknecht ◽

Matthias Krause

Keyword(s):

Algebraic Attacks ◽

With Memory

Download Full-text

The Impact of Decryption Failures on the Security of NTRU Encryption

Advances in Cryptology - CRYPTO 2003 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45146-4_14 ◽

2003 ◽

pp. 226-246 ◽

Cited By ~ 50

Author(s):

Nick Howgrave-Graham ◽

Phong Q. Nguyen ◽

David Pointcheval ◽

John Proos ◽

Joseph H. Silverman ◽

...

Keyword(s):

The Impact

Download Full-text

Relaxing Chosen-Ciphertext Security

Advances in Cryptology - CRYPTO 2003 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45146-4_33 ◽

2003 ◽

pp. 565-582 ◽

Cited By ~ 121

Author(s):

Ran Canetti ◽

Hugo Krawczyk ◽

Jesper B. Nielsen

Keyword(s):

Chosen Ciphertext Security

Download Full-text

A Message Authentication Code Based on Unimodular Matrix Groups

Advances in Cryptology - CRYPTO 2003 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45146-4_29 ◽

2003 ◽

pp. 500-512 ◽

Cited By ~ 3

Author(s):

Matthew Cary ◽

Ramarathnam Venkatesan

Keyword(s):

Message Authentication ◽

Message Authentication Code ◽

Authentication Code ◽

Matrix Groups ◽

Unimodular Matrix

Download Full-text

Luby-Rackoff: 7 Rounds Are Enough for 2 n(1 − ε) Security

Advances in Cryptology - CRYPTO 2003 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45146-4_30 ◽

2003 ◽

pp. 513-529 ◽

Cited By ~ 37

Author(s):

Jacques Patarin

Download Full-text

Password Interception in a SSL/TLS Channel

Advances in Cryptology - CRYPTO 2003 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45146-4_34 ◽

2003 ◽

pp. 583-599 ◽

Cited By ~ 73

Author(s):

Brice Canvel ◽

Alain Hiltgen ◽

Serge Vaudenay ◽

Martin Vuagnoux

Download Full-text

A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem

Advances in Cryptology - CRYPTO 2003 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45146-4_13 ◽

2003 ◽

pp. 212-225 ◽

Cited By ~ 24

Author(s):

Jung Hee Cheon ◽

Byungheup Jun

Keyword(s):

Polynomial Time ◽

Conjugacy Problem ◽

Polynomial Time Algorithm ◽

Time Algorithm ◽

Diffie Hellman

Download Full-text

Scalable Protocols for Authenticated Group Key Exchange

Advances in Cryptology - CRYPTO 2003 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45146-4_7 ◽

2003 ◽

pp. 110-125 ◽

Cited By ~ 172

Author(s):

Jonathan Katz ◽

Moti Yung

Keyword(s):

Key Exchange ◽

Group Key ◽

Group Key Exchange ◽

Authenticated Group Key ◽

Scalable Protocols

Download Full-text

Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret

Advances in Cryptology - CRYPTO 2003 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45146-4_5 ◽

2003 ◽

pp. 78-95 ◽

Cited By ~ 33

Author(s):

Renato Renner ◽

Stefan Wolf

Download Full-text

New Partial Key Exposure Attacks on RSA

Advances in Cryptology - CRYPTO 2003 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45146-4_2 ◽

2003 ◽

pp. 27-43 ◽

Cited By ~ 60

Author(s):

Johannes Blömer ◽

Alexander May

Keyword(s):

Key Exposure

Download Full-text

Advances in Cryptology - CRYPTO 2003 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Algebraic Attacks on Combiners with Memory

The Impact of Decryption Failures on the Security of NTRU Encryption

Relaxing Chosen-Ciphertext Security

A Message Authentication Code Based on Unimodular Matrix Groups

Luby-Rackoff: 7 Rounds Are Enough for 2 n(1 − ε) Security

Password Interception in a SSL/TLS Channel

A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem

Scalable Protocols for Authenticated Group Key Exchange

Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret

New Partial Key Exposure Attacks on RSA

Advances in Cryptology - CRYPTO 2003 - Lecture Notes in Computer Science
Latest Publications