Generating Large Instances of the Gong-Harn Cryptosystem

DOI10.1007/3-540-45325-3_28MaRDI QIDQ4550280zbMATHOpenAlexFDO

Authors Kenneth Giuliani, Guang Gong

Publication date 25 November 2002

Published in Cryptography and Coding (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45325-3_28

zbMATH Keywords

Gong-Harn cryptosystemthird-order characteristic sequences over finite fields

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2085212
• scientific article; zbMATH DE number 2160552
• Public-key cryptosystems based on cubic finite field extensions
• Generating elements of orders dividing \(p^6 \pm p^5 + p^4 \pm p^3 + p^2 \pm+1\)
• Gauss periods: orders and cryptographical applications

Cited in

(3)

• Message transmission for GH-public key cryptosystem
• scientific article; zbMATH DE number 2160552 (Why is no real title available?)
• Generating elements of orders dividing \(p^6 \pm p^5 + p^4 \pm p^3 + p^2 \pm+1\)

Describes a project that uses

Uses Software

• NTL

This page was built for publication: Generating Large Instances of the Gong-Harn Cryptosystem

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