Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields

DOI10.1007/BFB0027920MaRDI QIDQ4501492zbMATH OpenFDO

Authors Arjen K. Lenstra

Publication date 4 September 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0027920

zbMATH Keywords

cyclotomic polynomialsdiscrete logarithm based public key cryptosystemsfinite fields

Mathematics Subject Classification ID

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

Recommendations

• Towards faster cryptosystem. I
• A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
• Finite fields and cryptology
• scientific article; zbMATH DE number 3956969

Cited in

(9)

• A public-key cryptosystem utilizing cyclotomic fields
• Algebraic generalization of Diffie-Hellman key exchange
• scientific article; zbMATH DE number 5831613 (Why is no real title available?)
• XTR algorithm: efficient and compact subgroup trace representation
• Generalised Mersenne numbers revisited
• Algorithmic Number Theory
• Groups from cyclic infrastructures and Pohlig-Hellman in certain infrastructures
• Structure of cyclotomic polynomials and several applications
• Remarks on the coefficients of ternary cyclotomic and inverse cyclotomic polynomials

This page was built for publication: Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields

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