A monte carlo method for factorization
From MaRDI portal
Publication:4071300
DOI10.1007/BF01933667zbMath0312.10006WikidataQ55953264 ScholiaQ55953264MaRDI QIDQ4071300
Publication date: 1975
Published in: BIT (Search for Journal in Brave)
Related Items
Combinatorial cycles of a polynomial map over a commutative field, Modern factorization methods, Factoring multi-power RSA moduli with primes sharing least or most significant bits, Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries, Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude, Discrete logarithms in \(\mathrm{GF}(p)\), A Search for Large Twin Prime Pairs, Factoring RSA moduli with primes sharing bits in the middle, On multidimensional Diophantine approximation of algebraic numbers, Fiat-Shamir and correlation intractability from strong KDM-secure encryption, Cycle detection using a stack, On methods of shortening ElGamal-type signatures, Is the data encryption standard a group? (Results of cycling experiments on DES), Cycle structure of iterating Rédei functions, A probabilistic heuristic for counting components of functional graphs of polynomials over finite fields, Improved algorithm for the isogeny problem for ordinary elliptic curves, Periodic points of polynomials over finite fields, Dynamically distinguishing polynomials, Time-Memory Trade-Offs for Near-Collisions, Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs, On the functional graph of the power map over finite groups, Unnamed Item, Identity-based encryption in DDH hard groups, Periods of rational maps modulo primes, An efficient collision detection method for computing discrete logarithms with Pollard's rho, A quantum version of Pollard's Rho of which Shor's algorithm is a particular case, The number of rational points of hyperelliptic curves over subsets of finite fields, Fine-grained non-interactive key-exchange: constructions and lower bounds, \textsc{Rings}: an efficient Java/Scala library for polynomial rings, Geometrically nilpotent subvarieties, Factorization of the Eighth Fermat Number, Speeding up elliptic curve discrete logarithm computations with point halving, ITERATION OF QUADRATIC POLYNOMIALS OVER FINITE FIELDS, Factoring multi power RSA moduli with a class of secret exponents, Discrete logarithm based additively homomorphic encryption and secure data aggregation, Prime factorization using square root approximation, New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru, On random walks for Pollard's rho method, The influence of computers in the development of number theory, On the iteration of certain quadratic maps over GF(\(p\))., Modifikationen des Pollard-Algorithmus, The graph structure of Chebyshev polynomials over finite fields and applications, The functional graph of linear maps over finite fields and applications, A low-memory algorithm for finding short product representations in finite groups., Cycle detection algorithms and their applications, A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm, A natural lattice basis problem with applications, Factoring: algorithms, computations, and computers, On not storing the path of a random walk, Some remarks concerning the M.I.T. public-key cryptosystem, On computing ord\(_{N}(2)\) and its application, Finding strong pseudoprimes to several bases. II, A limit theorem for the six-length of random functional graphs with a fixed degree sequence, Analysis of a simple factorization algorithm, An improved Monte Carlo factorization algorithm, Improvement of FPPR method to solve ECDLP, Sufficient conditions for factoring a class of large integers, Large-Order Multiple Recursive Generators with Modulus 231 − 1, Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory, Non-interactive zero-knowledge in pairing-free groups from weaker assumptions, Toward a theory of Pollard's rho method, On cullen numbers, Cryptanalysis of RSA Using the Ratio of the Primes, Algorithm for factoring some RSA and Rabin moduli, Sequences of numbers generated by addition in formal groups and new primality and factorization tests, On the heuristic of approximating polynomials over finite fields by random mappings, Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli, Computing prime divisors in an interval, Lower bounds for the cycle detection problem, Euler’s constant: Euler’s work and modern developments, On the Equivalence of Generic Group Models, Factorization of the tenth Fermat number, The memory-tightness of authenticated encryption, Factoring on a computer, On the security of some variants of the RSA signature scheme, An Overview of Factoring, Prime Factorization without Using Any Approximations, Periods of iterated rational functions, Quantum key search for ternary LWE, On the streaming indistinguishability of a random permutation and a random function
Cites Work
