Pages that link to "Item:Q4071300"

The following pages link to A monte carlo method for factorization (Q4071300):

Displaying 50 items.

• Factoring multi-power RSA moduli with primes sharing least or most significant bits (Q285897) (← links)
• On multidimensional Diophantine approximation of algebraic numbers (Q331138) (← links)
• Improved algorithm for the isogeny problem for ordinary elliptic curves (Q360194) (← links)
• An efficient collision detection method for computing discrete logarithms with Pollard's rho (Q411043) (← links)
• Discrete logarithm based additively homomorphic encryption and secure data aggregation (Q433021) (← links)
• Factoring: algorithms, computations, and computers (Q547500) (← links)
• Prime factorization using square root approximation (Q639053) (← links)
• A low-memory algorithm for finding short product representations in finite groups. (Q664395) (← links)
• Cycle detection algorithms and their applications (Q690565) (← links)
• Improvement of FPPR method to solve ECDLP (Q740119) (← links)
• Toward a theory of Pollard's rho method (Q752762) (← links)
• Factoring on a computer (Q799723) (← links)
• Factoring multi power RSA moduli with a class of secret exponents (Q907002) (← links)
• A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm (Q968774) (← links)
• Combinatorial cycles of a polynomial map over a commutative field (Q1078246) (← links)
• Modern factorization methods (Q1085192) (← links)
• Discrete logarithms in \(\mathrm{GF}(p)\) (Q1094455) (← links)
• Is the data encryption standard a group? (Results of cycling experiments on DES) (Q1112006) (← links)
• The influence of computers in the development of number theory (Q1164656) (← links)
• Modifikationen des Pollard-Algorithmus (Q1172077) (← links)
• Analysis of a simple factorization algorithm (Q1239754) (← links)
• On the iteration of certain quadratic maps over GF(\(p\)). (Q1426120) (← links)
• Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries (Q1629393) (← links)
• Factoring RSA moduli with primes sharing bits in the middle (Q1647745) (← links)
• Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
• Geometrically nilpotent subvarieties (Q1696768) (← links)
• The graph structure of Chebyshev polynomials over finite fields and applications (Q1727357) (← links)
• The functional graph of linear maps over finite fields and applications (Q1727359) (← links)
• Sequences of numbers generated by addition in formal groups and new primality and factorization tests (Q1820186) (← links)
• Lower bounds for the cycle detection problem (Q1838298) (← links)
• Periods of rational maps modulo primes (Q1938071) (← links)
• Speeding up elliptic curve discrete logarithm computations with point halving (Q1943980) (← links)
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
• Non-interactive zero-knowledge in pairing-free groups from weaker assumptions (Q2055663) (← links)
• The memory-tightness of authenticated encryption (Q2096479) (← links)
• Quantum key search for ternary LWE (Q2118530) (← links)
• On the streaming indistinguishability of a random permutation and a random function (Q2119020) (← links)
• A limit theorem for the six-length of random functional graphs with a fixed degree sequence (Q2278111) (← links)
• Cycle detection using a stack (Q2390239) (← links)
• Cycle structure of iterating Rédei functions (Q2397505) (← links)
• A probabilistic heuristic for counting components of functional graphs of polynomials over finite fields (Q2398955) (← links)
• Dynamically distinguishing polynomials (Q2408984) (← links)
• The number of rational points of hyperelliptic curves over subsets of finite fields (Q2424286) (← links)
• On computing ord\(_{N}(2)\) and its application (Q2500476) (← links)
• On random walks for Pollard's rho method (Q2701566) (← links)
• Large-Order Multiple Recursive Generators with Modulus 2³¹ − 1 (Q2815474) (← links)
• On the heuristic of approximating polynomials over finite fields by random mappings (Q2828372) (← links)
• Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli (Q2829209) (← links)
• Euler’s constant: Euler’s work and modern developments (Q2849016) (← links)
• Time-Memory Trade-Offs for Near-Collisions (Q2946879) (← links)