A monte carlo method for factorization
From MaRDI portal
Recommendations
- An improved Monte Carlo factorization algorithm
- A Monte Carlo Factoring Algorithm With Linear Storage
- An efficient Monte Carlo solution for problems with random matrices
- Monte Carlo methods
- Monte Carlo methods
- scientific article; zbMATH DE number 1313731
- Monte Carlo methods
- Monte Carlo method
- A Monte Carlo method for high dimensional integration
- A new efficient Monte Carlo technique
Cites work
Cited in
(only showing first 100 items - show all)- Combinatorial cycles of a polynomial map over a commutative field
- Modern factorization methods
- Discrete logarithms in \(\mathrm{GF}(p)\)
- Is the data encryption standard a group? (Results of cycling experiments on DES)
- The influence of computers in the development of number theory
- Modifikationen des Pollard-Algorithmus
- Analysis of a simple factorization algorithm
- On the iteration of certain quadratic maps over GF(\(p\)).
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
- Factoring RSA moduli with primes sharing bits in the middle
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Geometrically nilpotent subvarieties
- The graph structure of Chebyshev polynomials over finite fields and applications
- The functional graph of linear maps over finite fields and applications
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests
- Lower bounds for the cycle detection problem
- Periods of rational maps modulo primes
- Speeding up elliptic curve discrete logarithm computations with point halving
- 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
- The memory-tightness of authenticated encryption
- Quantum key search for ternary LWE
- On the streaming indistinguishability of a random permutation and a random function
- A limit theorem for the six-length of random functional graphs with a fixed degree sequence
- Cycle detection using a stack
- Cycle structure of iterating Rédei functions
- A probabilistic heuristic for counting components of functional graphs of polynomials over finite fields
- Dynamically distinguishing polynomials
- The number of rational points of hyperelliptic curves over subsets of finite fields
- On computing ord\(_{N}(2)\) and its application
- On random walks for Pollard's rho method
- Large-order multiple recursive generators with modulus \(2^{31}-1\)
- 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
- Euler's constant: Euler's work and modern developments
- Factoring multi-power RSA moduli with primes sharing least or most significant bits
- Time-memory trade-offs for near-collisions
- Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs
- Sufficient conditions for factoring a class of large integers
- On multidimensional Diophantine approximation of algebraic numbers
- The Expectation of Success Using a Monte Carlo Factoring Method--Some Statistics on Quadratic Class Numbers
- A Monte Carlo Factoring Algorithm With Linear Storage
- Improving implementable meet-in-the-middle attacks by orders of magnitude
- New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru
- Improved algorithm for the isogeny problem for ordinary elliptic curves
- Cryptanalysis of RSA Using the Ratio of the Primes
- Algorithm for factoring some RSA and Rabin moduli
- On not storing the path of a random walk
- Some remarks concerning the M.I.T. public-key cryptosystem
- An improved Monte Carlo factorization algorithm
- scientific article; zbMATH DE number 3749093 (Why is no real title available?)
- Factorization of the Eighth Fermat Number
- An efficient collision detection method for computing discrete logarithms with Pollard's rho
- Monte Carlo Methods for Index Computation (mod p)
- A Search for Large Twin Prime Pairs
- On cullen numbers
- Factorization of the tenth Fermat number
- Discrete logarithm based additively homomorphic encryption and secure data aggregation
- scientific article; zbMATH DE number 1113841 (Why is no real title available?)
- A natural lattice basis problem with applications
- Finding strong pseudoprimes to several bases. II
- scientific article; zbMATH DE number 2068209 (Why is no real title available?)
- Iteration of quadratic polynomials over finite fields
- Periods of iterations of mappings over finite fields with restricted preimage sizes
- An overview of factoring
- On methods of shortening ElGamal-type signatures
- Periodic points of polynomials over finite fields
- Periods of iterated rational functions
- The factorisation of \(2^{67}-1\)
- Statistical mechanical formulation and simulation of prime factorization of integers
- Factoring: algorithms, computations, and computers
- Computing prime divisors in an interval
- On the Equivalence of Generic Group Models
- On the security of some variants of the RSA signature scheme
- Prime factorization without using any approximations
- On the functional graph of the power map over finite groups
- Identity-based encryption in DDH hard groups
- A quantum version of Pollard's Rho of which Shor's algorithm is a particular case
- Fine-grained non-interactive key-exchange: constructions and lower bounds
- \textsc{Rings}: an efficient Java/Scala library for polynomial rings
- Prime factorization using square root approximation
- On the deepest cycle of a random mapping
- Solving modular cubic equations with Coppersmith's method
- The Inverse of a Multiplication Trick
- Iterated monodromy groups of rational functions and periodic points over finite fields
- A low-memory algorithm for finding short product representations in finite groups.
- Fine-grained non-interactive key exchange, revisited
- CryptAttackTester: high-assurance attack analysis
- Beyond sequential walks: parallelizing the GA-dlog problem
- Reducing the number of qubits in quantum factoring
- Cycle detection algorithms and their applications
- Revisiting pairing-friendly curves with embedding degrees 10 and 14
- The graph of a family of functions over quadratic extensions of finite fields
- Quantum time-space tradeoff for finding multiple collision pairs
- Quantum collision search for ternary LWE keys
- Choosing iteration maps for the parallel Pollard rho method
- Constructing a parameterized polynomial map through functional graphs and applications
- Improvement of FPPR method to solve ECDLP
- Toward a theory of Pollard's rho method
- Factoring on a computer
This page was built for publication: A monte carlo method for factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4071300)
