Cryptography based on number fields with large regulator

DOI10.5802/JTNB.281MaRDI QIDQ5939711zbMATH OpenOpenAlexFDO

Authors Johannes Buchmann, Markus Maurer, Bodo Möller

Publication date 30 July 2001

Published in Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=JTNB_2000__12_2_293_0, https://eudml.org/doc/226542

class groups Fiat-Shamir identification PIP-FS principal ideals public key cryptosystem quadratic order

Quadratic extensions (11R11) Class numbers, class groups, discriminants (11R29) Class groups and Picard groups of orders (11R65) Cryptography (94A60)

Review text

The authors investigate a variant, called the PIP-FS, of the Fiat-Shamir identification and signature protocol based upon the intractability of computing generators of principal ideals in number fields. Moreover, they use the Cohen-Lenstra-Martinet heuristics for class groups in order to construct number fields in which the aforementioned computation is intractable. They describe an implementation of the PIP-FS in real quadratic orders using C++ and close the paper with a section on the timings for such implementations.

Cites work

Cited in

(4)

Describes a project that uses

Uses Software

LiDIA

This page was built for publication: Cryptography based on number fields with large regulator

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