The following pages link to (Q4273679):
Displaying 44 items.
- Computational hardness of IFP and ECDLP (Q505664) (← links)
- One approach to factorization of positive integers (Q647854) (← links)
- Computation of discrete logarithms in prime fields (Q1179517) (← links)
- A pentagonal number sieve (Q1268625) (← links)
- Batch RSA (Q1363068) (← links)
- How to fake an RSA signature by encoding modular root finding as a SAT problem (Q1408375) (← links)
- The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic (Q1671640) (← links)
- Approximating rings of integers in number fields (Q1805356) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- On the oracle complexity of factoring integers (Q1918949) (← links)
- Constructing digitized chaotic time series with a guaranteed enhanced period (Q2285727) (← links)
- On computing ord\(_{N}(2)\) and its application (Q2500476) (← links)
- Recovering Fourier coefficients of some functions and factorization of integer numbers (Q2513158) (← links)
- Subexponential time relations in the class group of large degree number fields (Q2513760) (← links)
- Integer factorization as subset-sum problem (Q2700674) (← links)
- An Implementation of the Number Field Sieve (Q2785383) (← links)
- Post-Quantum Cryptography: State of the Art (Q2803619) (← links)
- What is the Future of Cryptography? (Q2803620) (← links)
- Some mathematical remarks on the polynomial selection in NFS (Q2826687) (← links)
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields (Q3137444) (← links)
- Square Root Algorithms for the Number Field Sieve (Q3166983) (← links)
- On reduced Arakelov divisors of real quadratic fields (Q3178177) (← links)
- New weak keys in RSA (Q3443210) (← links)
- Algorithms for Black-Box Fields and their Application to Cryptography (Q3452358) (← links)
- (Q3495446) (← links)
- Another Generalization of Wiener’s Attack on RSA (Q3506378) (← links)
- The number field sieve for integers of low weight (Q3584792) (← links)
- (Q3615920) (← links)
- Cryptanalysis of RSA Using the Ratio of the Primes (Q3637134) (← links)
- (Q3712686) (← links)
- (Q4217634) (← links)
- (Q4247780) (← links)
- (Q4249695) (← links)
- (Q4273681) (← links)
- Factoring with Two Large Primes (Q4317677) (← links)
- Forty years of attacks on the RSA cryptosystem: A brief survey (Q5030492) (← links)
- A SAT-Based Approach for Index Calculus on Binary Elliptic Curves (Q5048971) (← links)
- A classification of ECM-friendly families of elliptic curves using modular curves (Q5070546) (← links)
- Cryptanalyses of Candidate Branching Program Obfuscators (Q5270365) (← links)
- When e-th Roots Become Easier Than Factoring (Q5387090) (← links)
- Solving modular cubic equations with Coppersmith's method (Q6543269) (← links)
- ECM and the Elliott-Halberstam conjecture for quadratic fields (Q6581190) (← links)
- We are on the same side. Alternative sieving strategies for the number field sieve (Q6604871) (← links)
- Improved computation of polynomial roots over number fields when using complex embeddings (Q6671812) (← links)
