Recent progress and prospects for integer factorisation algorithms
From MaRDI portal
Recommendations
Cited in
(16)- Factorizing RSA keys, an improved analogue solution
- Modern factorization methods
- Unconventional complexity measures for unconventional computers
- An improved parallel block Lanczos algorithm over GF(2) for integer factorization
- Parallel GNFS algorithm integrated with parallel block Wiedemann algorithm for RSA security in cloud computing
- Fast matrix decomposition in F₂
- Computational complexity in non-Turing models of computation: the what, the why and the how
- scientific article; zbMATH DE number 4165009 (Why is no real title available?)
- Another Generalization of Wiener’s Attack on RSA
- scientific article; zbMATH DE number 3924865 (Why is no real title available?)
- scientific article; zbMATH DE number 554529 (Why is no real title available?)
- Some lattice attacks on DSA and ECDSA
- Computing Prime Factorization And Discrete Logarithms: From Index Calculus To Xedni Calculus
- Some parallel algorithms for integer factorisation
- Some arithmetical properties on hyperbola
- Detecting regular visit patterns
This page was built for publication: Recent progress and prospects for integer factorisation algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2766810)