scientific article

From MaRDI portal
Publication:4046106

zbMath0294.10005MaRDI QIDQ4046106

J. M. Pollard

Publication date: 1974


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (74)

Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝On the distribution in short intervals of integers having no large prime factorSieve algorithms for perfect power testingModern factorization methodsFactoring multi-power RSA moduli with primes sharing least or most significant bitsNew weak keys in RSAOptimal strong primesFast generation of prime numbers and secure public-key cryptographic parameters.On finding primitive roots in finite fieldsFactoring RSA moduli with primes sharing bits in the middleFour consecutive primitive elementsin a finite fieldAsymptotically Fast Factorization of IntegersOn the oracle complexity of factoring integersA Superpowered Euclidean Prime GeneratorAn integrated parallel GNFS algorithm for integer factorization based on linbox montgomery block Lanczos method over \(GF(2)\)Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applicationsDeterministic factoring with oraclesFast norm computation in smooth-degree abelian number fields\textsc{Rings}: an efficient Java/Scala library for polynomial ringsFactoring integers and oracles for elliptic and hyperelliptic curvesOn completely factoring any integer efficiently in a single run of an order-finding algorithmExplicit methods in number theory. Abstracts from the workshop held July 18--24, 2021 (hybrid meeting)Factoring multi power RSA moduli with a class of secret exponentsOn oracle factoring of integersPrime factorization using square root approximationAn extension of a result about divisors in a residue class and its application to reducing integer factorization to computing Euler’s totientThe influence of computers in the development of number theoryA monte carlo method for factorizationA search for Wieferich and Wilson primesAn Identity-Based Key Agreement Protocol for the Network LayerRevisiting Wiener’s Attack – New Weak Keys in RSAImproved Stage 2 to P ± 1 Factoring AlgorithmsA novel ID-based group signatureSmoothness and factoring polynomials over finite fieldsECM using Edwards curvesEfficient verification of Tunnell's criterionComputation of the first factor of the class number of cyclotomic fieldsPermutation binomials and their groupsA deterministic version of Pollard’s $p-1$ algorithmFactoring: algorithms, computations, and computersDetecting squarefree numbersTwo methods of directly constructing probabilistic public-key encryption primitives based on third-order LFSR sequencesSome remarks concerning the M.I.T. public-key cryptosystemOdd orders in Shor's factoring algorithmA generic approach to searching for JacobiansRiemann's hypothesis and tests for primalityFactoring with hintsA deterministic algorithm for integer factorizationSpeeding up the computations on an elliptic curve using addition-subtraction chainsNew Cullen PrimesAn exponent one-fifth algorithm for deterministic integer factorisationAn improved Monte Carlo factorization algorithmImproved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime FactorsPolynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modulesFactoring numbers in O(log n) arithmetic stepsA note on Girault's self-certified modelCryptanalysis of Rédei- and Dickson permutations on arbitrary finite ringsНесколько замечаний о задаче дискретного логарифмирования на эллиптических кривыхLarge-Order Multiple Recursive Generators with Modulus 231 − 1Prime-number algorithm for public-key systemsSequences of numbers generated by addition in formal groups and new primality and factorization testsAdversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup ModuliLexicographic Gröbner bases of bivariate polynomials modulo a univariate oneA Subfield Lattice Attack on Overstretched NTRU AssumptionsComputing prime divisors in an intervalFactoring with Cyclotomic PolynomialsFactorization of the tenth Fermat numberA deterministic algorithm for finding \(r\)-power divisorsStrong pseudoprimes to base 2A Reduction of Integer Factorization to Modular TetrationFaster deterministic integer factorizationFactoring on a computerAn Overview of FactoringPrime Factorization without Using Any Approximations




This page was built for publication: