Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Eurocrypt

Known as: International Conference on the Theory and Applications of Cryptographic Techniques, Workshop on the Theory and Application of Cryptographic Techniques 
Eurocrypt (or EUROCRYPT) is a conference for cryptography research. The full name of the conference is now the Annual International Conference on the… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
  • Serge Vaudenay
  • Lecture Notes in Computer Science
  • 2006
  • Corpus ID: 35769125
Let g be an element of prime order p in an abelian group and α ∈ Zp. We show that if g, g, and gαd are given for a positive… Expand
  • table 3
  • figure 5
  • figure 6
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Cryptanalysis I.- Cryptanalysis of the Hash Functions MD4 and RIPEMD.- How to Break MD5 and Other Hash Functions.- Collisions of… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We identify and fill some gaps with regard to consistency (the extent to which false positives are produced) for public-key… Expand
  • figure 3
  • figure 4
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
2004
Highly Cited
2004
 
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The goals of this paper are two-fold. First we introduce and motivate a generalization of the fundamental concept of the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
  • Tor Helleseth
  • Lecture Notes in Computer Science
  • 2001
  • Corpus ID: 21157010
In this paper we show an explicit relation between authentication codes and codes correcting independent errors. This relation… Expand
  • figure 5
  • figure 7
  • table 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
In [1,2] we introduced the notion of differential cryptanalysis and described its application to DES[8] and several of its… Expand
  • table 3
  • figure 5
  • figure 6
  • table 3
  • table 3
Is this relevant?
Highly Cited
2001
Highly Cited
2001
  • Ueli Maurer
  • Lecture Notes in Computer Science
  • 2001
  • Corpus ID: 8893494
In this paper we present a new class of attacks against RSA with low encrypting exponent. The attacks enable the recovery of… Expand
  • table 1
  • table 2
  • table 3
  • figure 4
  • table 3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
  • Jacques Stern
  • Lecture Notes in Computer Science
  • 1999
  • Corpus ID: 29690672
We show that if the private exponent d used in the RSA public-key cryptosystem is less than N then the system is insecure. This… Expand
  • table 4
  • table 5
  • table 4
  • table 5
  • figure 4
Is this relevant?
Highly Cited
1994
Highly Cited
1994
In this paper we consider a new type of cryptographic scheme, which can decode concealed images without any cryptographic… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?