2007•arXiv (Cornell University)Open access

Birthday attack to discrete logarithm

An-Ping Li

Open full text 0 citations

Abstract

The discrete logarithm in a finite group of large order has been widely applied in public key cryptosystem. In this paper, we will present a probabilistic algorithm for discrete logarithm.

Open-access reader

About this research paper

What this paper is about

The discrete logarithm in a finite group of large order has been widely applied in public key cryptosystem. In this paper, we will present a probabilistic algorithm for discrete logarithm.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The discrete logarithm in a finite group of large order has been widely applied in public key cryptosystem. In this paper, we will present a probabilistic algorithm for discrete logarithm.

Key concepts: Discrete logarithm, Logarithm, Probabilistic logic, Key (lock), Iterated logarithm, Cryptosystem, Public key cryptosystem, Natural logarithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Birthday attack to discrete logarithm — Research Paper | ScholarLens