Analysis of a simple factorization algorithm
From MaRDI portal
Publication:1239754
DOI10.1016/0304-3975(76)90050-5zbMath0362.10006OpenAlexW2079631449MaRDI QIDQ1239754
Luis Trabb Pardo, Donald E. Knuth
Publication date: 1977
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(76)90050-5
Related Items
Random difference equations: An asymptotical result ⋮ Sieve algorithms for perfect power testing ⋮ Modern factorization methods ⋮ Fast generation of prime numbers and secure public-key cryptographic parameters. ⋮ Sieving the positive integers by large primes ⋮ Disinformation theory for bosonic computational media ⋮ Benford behavior and distribution in residue classes of large prime factors ⋮ Intermediate prime factors in specified subsets ⋮ Fault attacks on hyperelliptic curve discrete logarithm problem over binary field ⋮ On logarithmic asymptotics for the number of restricted partitions in the exponential case ⋮ On the deterministic complexity of factoring polynomials over finite fields ⋮ Arithmetic of finite fields ⋮ Cryptographic transformations of non-Shannon sources of information ⋮ Comparison of the efficiency of the factoring algorithms of Morrison-Brillhart and Schroeppel ⋮ A Practical Analysis of the Elliptic Curve Factoring Algorithm ⋮ Оценки количества чисел со специальным разложением на простые множители ⋮ Bose-Einstein distribution as a problem of analytic number theory: the case of less than two degrees of freedom ⋮ On the asymptotics of the element counting function in an additive arithmetic semigroup with exponential counting function of prime generators ⋮ On the largest prime factor of an integer ⋮ Random multiplicative walks on the residues modulo n ⋮ A new algorithm to search for small nonzero |𝑥³-𝑦²| values ⋮ Two Differential-Difference Equations Arising in Number Theory ⋮ Duality between prime factors and an application to the prime number theorem for arithmetic progressions ⋮ A pair of difference differential equations of Euler-Cauchy type ⋮ The ubiquitous Ewens sampling formula ⋮ Модификация алгоритма оценки количества целых чисел, имеющих не более трех больших простых делителей ⋮ Nicolaas Govert de Bruijn, the enchanter of friable integers ⋮ Оценки количества чисел со специальным разложением на простые множители. II ⋮ Prime-number algorithm for public-key systems ⋮ Asymptotic semismoothness probabilities ⋮ A sieve result for Farey fractions ⋮ Euler’s constant: Euler’s work and modern developments ⋮ The Dickman–Goncharov distribution ⋮ Factorization of the tenth Fermat number ⋮ Sums over numbers with restricted prime factors ⋮ Factoring Numbers on the Massively Parallel Computer ⋮ Integers without large prime factors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The number of positiv integers \(\leq x\) and free of prime divisors \(>x^c\), and a problem of S. S. Pillai
- A monte carlo method for factorization
- A design for a number theory package with an optimized trial division routine
- Ordered Cycle Lengths in a Random Permutation
- On the Numerical Solution of a Differential-Difference Equation Arising in Analytic Number Theory
- Numbers with small prime factors, and the least 𝑘th power non-residue
