Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2006

Highly Cited

2006

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

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

Is this relevant?

Highly Cited

2004

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

Is this relevant?

Highly Cited

2001

Highly Cited

2001

In this paper we show an explicit relation between authentication codes and codes correcting independent errors. This relation… Expand

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

Is this relevant?

Highly Cited

2001

Highly Cited

2001

In this paper we present a new class of attacks against RSA with low encrypting exponent. The attacks enable the recovery of… Expand

Is this relevant?

Highly Cited

1999

Highly Cited

1999

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

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

Is this relevant?