Elliptic Curves Discrete Logarithm Problem over a Finite Prime Field Fp and p-adic Approximations

Franck Leprévost; Nicolas Bernard; Pascal Bouvry

doi:10.1145/3274856.3274860

ScienceGate Book Chapters

JOURNAL ARTICLE

Elliptic Curves Discrete Logarithm Problem over a Finite Prime Field Fp and p-adic Approximations

Franck Leprévost Nicolas Bernard Pascal Bouvry

Year: 2018 Pages: 9-15

DOI: 10.1145/3274856.3274860

Get Full-Text PDF Get Analytical Report

Abstract

peer reviewed

Keywords:

Schoof's algorithm Discrete logarithm Mathematics Elliptic curve Finite field Logarithm Counting points on elliptic curves Context (archaeology) Prime (order theory) Integer (computer science) Discrete mathematics Order (exchange) Supersingular elliptic curve Computation Pure mathematics Combinatorics Mathematical analysis Algorithm Computer science Quarter period Public-key cryptography

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.22

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Cryptography and Residue Arithmetic

Physical Sciences → Computer Science → Information Systems

Elliptic Curves Discrete Logarithm Problem over a Finite Prime Field Fp and p-adic Approximations

Abstract

Metrics

Topics

Related Documents

On the discrete logarithm problem for prime-field elliptic curves

The Elliptic Curve Discrete Logarithm Problems over the p-adic Field and Formal Groups

Elliptic Curves over p-adic field Q_p and its p-adic point addition

On the discrete logarithm problem in elliptic curves

Algebraic Approaches for the Elliptic Curve Discrete Logarithm Problem over Prime Fields