scientific article; zbMATH DE number 3959521
From MaRDI portal
Publication:3728066
Recommendations
Cited in
(33)- On the distribution in short intervals of integers having no large prime factor
- Factoring RSA moduli with primes sharing bits in the middle
- Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
- Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\)
- Factoring with the quadratic sieve on large vector computers
- Mathematical problems in cryptology
- Index calculation attacks on RSA signature and encryption
- On computing ord\(_{N}(2)\) and its application
- Recovering Fourier coefficients of some functions and factorization of integer numbers
- Factorization using binary decision diagrams
- Post-quantum cryptography: state of the art
- Factoring multi-power RSA moduli with primes sharing least or most significant bits
- Practical cryptanalysis of ISO 9796-2 and EMV signatures
- Running Time Predictions for Factoring Algorithms
- Smooth numbers and the quadratic sieve
- The Multiple Polynomial Quadratic Sieve
- A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
- scientific article; zbMATH DE number 17387 (Why is no real title available?)
- On sharp transitions in making squares
- scientific article; zbMATH DE number 708815 (Why is no real title available?)
- scientific article; zbMATH DE number 2162228 (Why is no real title available?)
- Factorization using the quadratic sieve algorithm
- Forty years of attacks on the RSA cryptosystem: a brief survey
- Some arithmetical properties on hyperbola
- Using LLL-reduction for solving RSA and factorization problems
- Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms
- scientific article; zbMATH DE number 2230939 (Why is no real title available?)
- On the number of semismooth integers
- Supersingular j-invariants and the class number of ℚ(−p)
- An integrated parallel GNFS algorithm for integer factorization based on linbox montgomery block Lanczos method over GF(2)
- Computational Number Theory, Past, Present, and Future
- Factoring multi power RSA moduli with a class of secret exponents
- Efficient verification of Tunnell's criterion
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3728066)