Study of the discrete logarithm problem in F_p^ 3

DOI10.5802/AFST.797zbMATH Open0846.11067OpenAlexW2017332774MaRDI QIDQ1903546FDOQ1903546

Oumar Ndiaye El Hadji

Publication date: 11 January 1996

Published in: Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=AFST_1995_6_4_2_269_0

Recommendations

• A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
• On Computing Logarithms Over Finite Fields
• A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
• Computation of discrete logarithms in an arbitrary finite field
• scientific article

zbMATH Keywords

algorithmdiscrete logarithm problemfinite fieldspublic key cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A classical invitation of algebraic numbers and class fields. With two appendices by Olga Taussky: ``Artin's 1932 Göttingen lectures on class field theory and ``Connections between algebraic number theory and integral matrices.
• A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
• Title not available (Why is that?)
• The Euclidean Condition in Pure Cubic and Complex Quartic Fields
• Fast Computation of Discrete Logarithms in GF (q)

Cited In (3)

• A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
• A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
• Discrete Restriction for (x,x3) and Related Topics

This page was built for publication: Study of the discrete logarithm problem in \(\mathbb{F}_{p^ 3}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1903546)