**Getting Rid of Linear Algebra in Number Theory Problems**

*Paul Kirchner and Pierre-Alain Fouque*

**Abstract: **We revisit some well-known cryptographic problems in a black box modular ring model of computation. This model allows us to compute with black box access to the ring $\mathbb{Z}/m\mathbb{Z}$. We develop new generic ring algorithms to recover $m$ even if it is unknown. At the end, Maurer's generic algorithm allows to recover an element from its black box representation. However, we avoid Maurer's idealized model with CDH oracle for the multiplication in the hidden ring by introducing a new representation compatible with ring operations. An element is encoded by its action over the factor basis. Consequently, we can multiply two elements with classical descent computations in sieving algorithms. As the algorithms we propose work without using an expensive linear algebra computation at the end, even though they manipulate large sparse matrices, we can exploit a high-level of parallelism.

Then, we consider general groups such as imaginary quadratic class group and the Jacobian of a hyperelliptic curve, and obtain new methods for group order computation. The repeated squaring problem and the adaptive root problem used in the construction of Verifiable Delay Functions are particularly easy to solve in the black box modular ring, the high degree of parallelism provided by our method allows a reduction in the time to solve them. We improve the smoothing time, and as a result, we break Verifiable Delay Functions and factorize weak keys with lower Area-Time cost.

Finally, we show new AT costs for computing a discrete logarithm over an adversarial basis in finite fields.

**Category / Keywords: **public-key cryptography / number theory, discrete logarithm, factorization, VDF

**Date: **received 31 Dec 2020, last revised 4 Jan 2021

**Contact author: **paul kirchner at irisa fr,pierre-alain fouque@irisa fr

**Available format(s): **PDF | BibTeX Citation

**Version: **20210104:220539 (All versions of this report)

**Short URL: **ia.cr/2020/1619

[ Cryptology ePrint archive ]