Sieving for twin smooth integers with solutions to the Prouhet-Tarry-Escott problem

DOI10.1007/978-3-030-77870-5_10zbMath1483.94040OpenAlexW3096285322MaRDI QIDQ2056687

Yanyan Li

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-77870-5_10

zbMATH Keywords

post-quantum cryptographyProuhet-Tarry-Escott problemisogeny-based cryptographyB-SIDHSQISigntwin smooth integers

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves over global fields (11G05) Diophantine equations in many variables (11D72) Distribution of integers with specified multiplicative constraints (11N25) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items

M-SIDH and MD-SIDH: countering SIDH attacks by masking information, New algorithms for the Deuring correspondence. Towards practical and secure SQISign signatures, Accelerating the Delfs-Galbraith algorithm with fast subfield root detection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Prouhet-Tarry-Escott problem revisited
• An asymptotic formula for the number of smooth values of a polynomial
• On a problem of Störmer
• SQISign: compact post-quantum signatures from quaternions and isogenies
• B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion
• Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
• Reducibility Among Combinatorial Problems
• On a Conjecture of Balog
• Ideal 9th-Order Multigrades and Letac's Elliptic Curve
• An note on the Tarry-Escott problem.
• The Prouhet-Tarry-Escott problem for Gaussian integers
• ON TARRY'S PROBLEM (I)
• Faster computation of isogenies of large prime degree