Factorization, malleability and equivalent problems
From MaRDI portal
Recommendations
Cites work
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A modification of the RSA public-key encryption procedure (Corresp.)
- Computing the order of points on an elliptic curve modulo N is as difficult as factoring N
- Conditional bounds for the least quadratic non-residue and related problems
- Deterministic integer factorization with oracles for Euler's totient function
- Factoring integers with elliptic curves
- Factoring with Cyclotomic Polynomials
- Finding a small root of a bivariate integer equation; factoring with high bits known
- scientific article; zbMATH DE number 1303149 (Why is no real title available?)
- Instantiability of RSA-OAEP under chosen-plaintext attack
- Integer factoring problem and elliptic curves over the ring \(\mathbb Z_n\)
- Riemann's hypothesis and tests for primality
- Searching for Primitive Roots in Finite Fields
- Small primitive roots and malleability of RSA moduli
- Sums of Divisors, Perfect Numbers and Factoring
- The least quadratic non residue
- There are infinitely many Carmichael numbers
- Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
This page was built for publication: Factorization, malleability and equivalent problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6196945)