Paper 2023/1576
Towards Optimally Small Smoothness Bounds for Cryptographic-Sized Twin Smooth Integers and their Isogeny-based Applications
Abstract
We give a new approach for finding large smooth twins. Those twins whose sum is a prime are of interest in the parameter setup of certain isogeny-based cryptosystems such as SQIsign. The approach to find such twins is to find two polynomials in
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Minor revision. Selected Areas in Cryptography SAC 2024
- Keywords
- Post-quantum cryptographyisogeny-based cryptographytwin smooth integersextended Euclidean algorithmSQIsign
- Contact author(s)
- bruno-sydney sterner @ inria fr
- History
- 2025-01-22: last of 2 revisions
- 2023-10-12: received
- See all versions
- Short URL
- https://ia.cr/2023/1576
- License
-
CC0
BibTeX
@misc{cryptoeprint:2023/1576, author = {Bruno Sterner}, title = {Towards Optimally Small Smoothness Bounds for Cryptographic-Sized Twin Smooth Integers and their Isogeny-based Applications}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/1576}, year = {2023}, url = {https://eprint.iacr.org/2023/1576} }