Study of the discrete logarithm problem in \(\mathbb{F}_{p^ 3}\)

DOI10.5802/afst.797zbMath0846.11067OpenAlexW2017332774MaRDI QIDQ1903546

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

zbMATH Keywords

algorithmfinite fieldsdiscrete logarithm problempublic key cryptography

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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.
• Fast Computation of Discrete Logarithms in GF (q)
• A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
• The Euclidean Condition in Pure Cubic and Complex Quartic Fields

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