Skip to search formSkip to main content

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

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

2015

2015

The Pohlig-Hellman algorithm is an algorithm that solves the discrete logarithm problem. The algorithm simplifies the problem by… Expand

Is this relevant?

2010

2010

The objective of this paper is to implement a baseband OFDM transceiver on FPGA hardware. The design uses 8-point SLT/ISLT… Expand

Is this relevant?

2009

2009

This paper proposes a digital multi-signature scheme on the generalized conic curve over Z"n. The generalized conic curve R"n (a… Expand

Is this relevant?

2008

2008

In discrete logarithm based cryptography, a method by Pohlig and
Hellman allows solving the discrete logarithm problem… Expand

Is this relevant?

2008

2008

This paper described correlative concepts of Elliptic Curve Cryptography(ECC).And on the basis of making a study of Elliptic… Expand

Is this relevant?

2007

2007

En els darrers anys, l'us de les corbes el·liptiques en criptografia basada en el problema del logaritme discret s'ha anat… Expand

Is this relevant?

2005

2005

Diffie-Hellman (DH) is a well-known cryptographic algorithm used for secure key exchange. The first appearance of DH was in 1976… Expand

Is this relevant?

1999

1999

We present a new algorithm that extends the techniques of the Pohlig?Hellman algorithm for discrete logarithm computation to the… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

The difficulty of computing discrete logarithms known to be "short" is examined, motivated by recent practical interest in using… Expand

Is this relevant?

1993

1993

We describe a method for computing discrete logarithms in any nonsimple cyclic group, which may be considered as a serial version… Expand

Is this relevant?