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

2005

Highly Cited

2005

In this paper, we quantify the energy cost of authentication and key exchange based on public-key cryptography on an 8-bit… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

We present the first known implementation of elliptic curve cryptography over F/sub 2p/ for sensor networks based on the 8-bit, 7… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

Strong public-key cryptography is often considered to be too computationally expensive for small devices if not accelerated by… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

This paper introduces and makes concrete the concept of certificateless public key cryptography (CL-PKC), a model for the use of… Expand

Is this relevant?

Highly Cited

1999

Highly Cited

1999

This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to… Expand

Is this relevant?

Highly Cited

1999

Highly Cited

1999

Algebraic key establishment protocols based on the difficulty of solving equations over algebraic structures are described as a… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

First, we introduce the notion of divertibility as a protocol property as opposed to the existing notion as a language property… Expand

Is this relevant?

Highly Cited

1994

Highly Cited

1994

Foreword. Preface. 1. Introduction to Public Key Cryptography. 2. Introduction to Elliptic Curves. 3. Isomorphism Classes of… Expand

Is this relevant?

Highly Cited

1980

Highly Cited

1980

New Cryptographic protocols which take full advantage of the unique properties of public key cryptosystems are now evolving… Expand

Is this relevant?

Highly Cited

1979

Highly Cited

1979

Certain cryptographic keys, such as a number which makes it possible to compute the secret decoding exponent in an RSA public key… Expand

Is this relevant?