Cryptography based on number fields with large regulator (Q5939711)

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.