Groups from Cyclic Infrastructures and Pohlig-Hellman in Certain Infrastructures
Felix Fontein (University of Zurich)

TL;DR
This paper demonstrates that the Pohlig-Hellman algorithm can be adapted to certain cyclic infrastructures, revealing vulnerabilities and guiding cryptographic security considerations in infrastructure-based systems.
Contribution
It extends the applicability of the Pohlig-Hellman method to cyclic infrastructures, generalizing previous results and providing tools to assess their cryptographic security.
Findings
Pohlig-Hellman can be adapted to certain cyclic infrastructures.
Algorithms to test infrastructure suitability for Pohlig-Hellman.
Implications for cryptography based on cyclic infrastructures.
Abstract
In discrete logarithm based cryptography, a method by Pohlig and Hellman allows solving the discrete logarithm problem efficiently if the group order is known and has no large prime factors. The consequence is that such groups are avoided. In the past, there have been proposals for cryptography based on cyclic infrastructures. We will show that the Pohlig-Hellman method can be adapted to certain cyclic infrastructures, which similarly implies that certain infrastructures should not be used for cryptography. This generalizes a result by M\"uller, Vanstone and Zuccherato for infrastructures obtained from hyperelliptic function fields. We recall the Pohlig-Hellman method, define the concept of a cyclic infrastructure and briefly describe how to obtain such infrastructures from certain function fields of unit rank one. Then, we describe how to obtain cyclic groups from discrete cyclic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
