x]) and after running in time at most t, A solves the

**discrete logarithm problem**x = [log.This definition appears frequently and is found in the following Acronym Finder categories:

- Information technology (IT) and computers
- Science, medicine, engineering, etc.

See other **definitions of DLP**

Other Resources:

We have 139 other **meanings of DLP** in our Acronym Attic

- Abbreviation Database Surfer
- « Previous
- Next »

- Digital Llama Productions
- Digitell Legacy Productions
- Dimension/Length Profile
- Direct Link Protocol (IEEE 802.11e)
- Direct Loan Program
- Direct-Labeled Probe
- Direction de la Lecture Publique (French: Directorate of Public Reading; also seen as DLLP)
- Director of Laboratory Programs
- Disabilities Law Project (Pennsylvania, USA)
- Disability Law and Policy Program (Syracuse University; New York)

x]) and after running in time at most t, A solves the **discrete logarithm problem** x = [log.

1 **Discrete Logarithm Problem** Discrete logarithms are perhaps simplest to understand in the group [[].

3 **Discrete logarithm problem** Given a finite cyclic group G of order n, a generator [alpha] of G and an element b [member of] G, find the integer x, 0 [less than or equal to] x [less than or equal to] n - 1 such that [[alpha].

Nevertheless, these schemes are primarily based on the **discrete logarithm problem** (DLP) [3] or the elliptic curve **discrete logarithm problem** (ECDLP) [12] and not applicable to RSA-based systems [15].

The Certicom ECC Challenge was developed in November 1997 to increase the industry's understanding and appreciation for the difficulty of the elliptic curve **discrete logarithm problem** (ECDLP), which forms the basis for the security of elliptic curve cryptography (ECC).

During the two-day course in Baltimore, Whyte will describe implementation issues and security considerations for public-key cryptosystems based on the standard **discrete logarithm problem**.

NTRU is the first practical and secure public key cryptosystem not based on factorization or **discrete logarithm problems**, which require the use of extremely large integers or complex structures.

Certicom's ECC Challenge, launched November 6, 1997, is the first and only of its kind developed to increase the industry's understanding and appreciation for the difficulty of the elliptic curve **discrete logarithm problem**, and to encourage and stimulate further research in the security analysis of elliptic curve cryptosystems.