scientific article
From MaRDI portal
Publication:3728066
zbMath0596.10006MaRDI QIDQ3728066
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Software, source code, etc. for problems pertaining to number theory (11-04) Factorization (11Y05)
Related Items (23)
On the distribution in short intervals of integers having no large prime factor ⋮ Factoring multi-power RSA moduli with primes sharing least or most significant bits ⋮ Factorization using binary decision diagrams ⋮ Practical cryptanalysis of ISO 9796-2 and EMV signatures ⋮ Factoring RSA moduli with primes sharing bits in the middle ⋮ SOME ARITHMETICAL PROPERTIES ON HYPERBOLA ⋮ Mathematical problems in cryptology ⋮ An integrated parallel GNFS algorithm for integer factorization based on linbox montgomery block Lanczos method over \(GF(2)\) ⋮ Running Time Predictions for Factoring Algorithms ⋮ Computational Number Theory, Past, Present, and Future ⋮ Factoring multi power RSA moduli with a class of secret exponents ⋮ On sharp transitions in making squares ⋮ 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)\) ⋮ Efficient verification of Tunnell's criterion ⋮ Index calculation attacks on RSA signature and encryption ⋮ Using LLL-Reduction for Solving RSA and Factorization Problems ⋮ On computing ord\(_{N}(2)\) and its application ⋮ Recovering Fourier coefficients of some functions and factorization of integer numbers ⋮ Post-Quantum Cryptography: State of the Art ⋮ On the number of semismooth integers ⋮ Supersingular j-invariants and the class number of ℚ(−p) ⋮ Forty years of attacks on the RSA cryptosystem: A brief survey
This page was built for publication:
