Discrete logarithm based cryptosystems in quadratic function fields of characteristic 2

DOI10.1023/A:1008240113843MaRDI QIDQ1389154zbMATH OpenOpenAlexFDO

Authors Volker Müller, Scott A. Vanstone, Robert J. Zuccherato

Publication date 12 August 1998

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008240113843

zbMATH Keywords

characteristic twodigital signaturesdiscrete logarithmfunction fieldsideal multiplicationkey exchange

Mathematics Subject Classification ID

Arithmetic theory of algebraic function fields (11R58) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Review text

A key exchange scheme in the infrastructure of a quadratic function field of even characteristic is described. It extends earlier work of \textit{R. Scheidler, J. A. Buchmann} and \textit{H. C. Williams} [J. Cryptology 7, 171-199 (1994; Zbl 0816.94018)] in fields of odd characteristic, using the equivalence class in the ideal class group, to function fields of even characteristic. Such key exchanges take place in an algebraic system which is not a group. The infrastructure of quadratic function fields of even characteristic is first examined. Two operations in the infrastructure are defined, the Baby-Step and the Giant-Step. The Baby-Step corresponds to one iteration of the continued fraction algorithm and a Giant-Step corresponds to ideal multiplication and reduction. The concept of distance in the algebraic system is introduced and algorithms are developed for computing ideals `closest to' a given value. These algorithms are used to define the key exchange and digital signature schemes in the structure. Section 3 of the paper gives the algorithms needed to implement the key exchange and digital signature protocols using the quadratic function fields. The following two sections give the protocols and examine their security in a manner similar to the Pohlig-Hellman attack in finite groups. The final section discusses implementations of the protocols.

Recommendations

• Cryptography in quadratic function fields
• A key-exchange system based on imaginary quadratic fields
• A key-exchange protocol using real quadratic fields
• scientific article; zbMATH DE number 4168790
• An improved real-quadratic-field-based key exchange procedure
• Improved exponentiation and key agreement in the infrastructure of a real quadratic field
• scientific article; zbMATH DE number 177026
• scientific article; zbMATH DE number 4215364
• The efficiency and security of a real quadratic field based key exchange protocol
• Key-exchange in real quadratic congruence function fields

Cited in

(5)

• An overview of trace based public key cryptography over finite fields
• Computing discrete logarithms in real quadratic congruence function fields of large genus
• scientific article; zbMATH DE number 1406767 (Why is no real title available?)
• Cryptography in quadratic function fields
• Guest editorial: Special issue in honor of Scott A. Vanstone

This page was built for publication: Discrete logarithm based cryptosystems in quadratic function fields of characteristic 2

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