Factorization, malleability and equivalent problems

DOI10.4064/bc126-3MaRDI QIDQ6196945

Jorge J. Urroz

Publication date: 15 March 2024

Published in: Banach Center Publications (Search for Journal in Brave)

zbMATH Keywords

elliptic curvesInteger factorization

Mathematics Subject Classification ID

Factorization; primality (11A51) Elliptic curves over local fields (11G07) Factorization (11Y05)

Cites Work

• Unnamed Item
• Factoring integers with elliptic curves
• Riemann's hypothesis and tests for primality
• There are infinitely many Carmichael numbers
• Instantiability of RSA-OAEP under chosen-plaintext attack
• The least quadratic non residue
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• Small primitive roots and malleability of RSA moduli
• Sums of Divisors, Perfect Numbers and Factoring
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Factoring with Cyclotomic Polynomials
• A modification of the RSA public-key encryption procedure (Corresp.)
• Searching for Primitive Roots in Finite Fields
• Deterministic Integer Factorization with Oracles for Euler’s Totient Function
• Integer factoring problem and elliptic curves over the ring $\mathbb Z_n$
• Conditional bounds for the least quadratic non-residue and related problems
• Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
• Computing the order of points on an elliptic curve modulo \(N\) is as difficult as factoring \(N\)

This page was built for publication: Factorization, malleability and equivalent problems