scientific article; zbMATH DE number 475432
From MaRDI portal
Publication:4273679
Recommendations
Cited in
(82)- Comparison of the efficiency of the factoring algorithms of Morrison-Brillhart and Schroeppel
- Computation of discrete logarithms in prime fields
- A pentagonal number sieve
- Modifications to the number field sieve
- Batch RSA
- How to fake an RSA signature by encoding modular root finding as a SAT problem
- The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic
- Rigorous analysis of a randomised number field sieve
- Approximating rings of integers in number fields
- Mathematical problems in cryptology
- On the oracle complexity of factoring integers
- Constructing digitized chaotic time series with a guaranteed enhanced period
- On computing ord\(_{N}(2)\) and its application
- Recovering Fourier coefficients of some functions and factorization of integer numbers
- Subexponential time relations in the class group of large degree number fields
- Integer factorization as subset-sum problem
- A survey on the number field sieve
- scientific article; zbMATH DE number 1643927 (Why is no real title available?)
- An Implementation of the Number Field Sieve
- Post-quantum cryptography: state of the art
- What is the Future of Cryptography?
- Some mathematical remarks on the polynomial selection in NFS
- Factoring integers by CVP algorithms
- Mersenne factorization factory
- Analysis of the lattice sieve
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
- Square Root Algorithms for the Number Field Sieve
- On reduced Arakelov divisors of real quadratic fields
- A Monte Carlo Factoring Algorithm With Linear Storage
- On polynomial selection for the general number field sieve
- New weak keys in RSA
- Algorithms for black-box fields and their application to cryptography
- scientific article; zbMATH DE number 4168803 (Why is no real title available?)
- Another Generalization of Wiener’s Attack on RSA
- The number field sieve for integers of low weight
- Smooth numbers and the quadratic sieve
- scientific article; zbMATH DE number 5532100 (Why is no real title available?)
- Cryptanalysis of RSA Using the Ratio of the Primes
- scientific article; zbMATH DE number 3939832 (Why is no real title available?)
- scientific article; zbMATH DE number 1185143 (Why is no real title available?)
- scientific article; zbMATH DE number 1186937 (Why is no real title available?)
- scientific article; zbMATH DE number 1186939 (Why is no real title available?)
- Asymptotically Fast Factorization of Integers
- A Rigorous Time Bound for Factoring Integers
- scientific article; zbMATH DE number 177024 (Why is no real title available?)
- scientific article; zbMATH DE number 1222138 (Why is no real title available?)
- scientific article; zbMATH DE number 1302464 (Why is no real title available?)
- scientific article; zbMATH DE number 1303173 (Why is no real title available?)
- scientific article; zbMATH DE number 475430 (Why is no real title available?)
- scientific article; zbMATH DE number 475431 (Why is no real title available?)
- scientific article; zbMATH DE number 475434 (Why is no real title available?)
- scientific article; zbMATH DE number 475435 (Why is no real title available?)
- scientific article; zbMATH DE number 475436 (Why is no real title available?)
- Discrete logarithms and local units
- Factoring with Two Large Primes
- scientific article; zbMATH DE number 733561 (Why is no real title available?)
- scientific article; zbMATH DE number 1024053 (Why is no real title available?)
- scientific article; zbMATH DE number 1113827 (Why is no real title available?)
- scientific article; zbMATH DE number 1759342 (Why is no real title available?)
- Integer factoring using small algebraic dependencies
- On a strategy in the sieving procedure for the factorization of large natural numbers
- scientific article; zbMATH DE number 780072 (Why is no real title available?)
- Forty years of attacks on the RSA cryptosystem: a brief survey
- A SAT-Based Approach for Index Calculus on Binary Elliptic Curves
- Computational hardness of IFP and ECDLP
- A classification of ECM-friendly families of elliptic curves using modular curves
- The South Caicos factoring algorithm
- Cryptanalyses of Candidate Branching Program Obfuscators
- Optimal Parameterization of SNFS
- The Dixon algorithm: properties, modifications, and applications
- A Kilobit Special Number Field Sieve Factorization
- When e-th Roots Become Easier Than Factoring
- Predicting the Sieving Effort for the Number Field Sieve
- On finding Fermat’s pairs
- One approach to factorization of positive integers
- Solving modular cubic equations with Coppersmith's method
- ECM and the Elliott-Halberstam conjecture for quadratic fields
- We are on the same side. Alternative sieving strategies for the number field sieve
- Improved computation of polynomial roots over number fields when using complex embeddings
- First-degree prime ideals of composite extensions
- Subspace profiles over finite fields and q-Whittaker expansions of symmetric functions
- Subspace profiles, q-Whittaker functions and Krylov method
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 Q4273679)
