scientific article
From MaRDI portal
Publication:4046106
zbMath0294.10005MaRDI QIDQ4046106
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 factor ⋮ Sieve algorithms for perfect power testing ⋮ Modern factorization methods ⋮ Factoring multi-power RSA moduli with primes sharing least or most significant bits ⋮ New weak keys in RSA ⋮ Optimal strong primes ⋮ Fast generation of prime numbers and secure public-key cryptographic parameters. ⋮ On finding primitive roots in finite fields ⋮ Factoring RSA moduli with primes sharing bits in the middle ⋮ Four consecutive primitive elementsin a finite field ⋮ Asymptotically Fast Factorization of Integers ⋮ On the oracle complexity of factoring integers ⋮ A Superpowered Euclidean Prime Generator ⋮ An 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 applications ⋮ Deterministic factoring with oracles ⋮ Fast norm computation in smooth-degree abelian number fields ⋮ \textsc{Rings}: an efficient Java/Scala library for polynomial rings ⋮ Factoring integers and oracles for elliptic and hyperelliptic curves ⋮ On completely factoring any integer efficiently in a single run of an order-finding algorithm ⋮ Explicit 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 exponents ⋮ On oracle factoring of integers ⋮ Prime factorization using square root approximation ⋮ An extension of a result about divisors in a residue class and its application to reducing integer factorization to computing Euler’s totient ⋮ The influence of computers in the development of number theory ⋮ A monte carlo method for factorization ⋮ A search for Wieferich and Wilson primes ⋮ An Identity-Based Key Agreement Protocol for the Network Layer ⋮ Revisiting Wiener’s Attack – New Weak Keys in RSA ⋮ Improved Stage 2 to P ± 1 Factoring Algorithms ⋮ A novel ID-based group signature ⋮ Smoothness and factoring polynomials over finite fields ⋮ ECM using Edwards curves ⋮ Efficient verification of Tunnell's criterion ⋮ Computation of the first factor of the class number of cyclotomic fields ⋮ Permutation binomials and their groups ⋮ A deterministic version of Pollard’s $p-1$ algorithm ⋮ Factoring: algorithms, computations, and computers ⋮ Detecting squarefree numbers ⋮ Two methods of directly constructing probabilistic public-key encryption primitives based on third-order LFSR sequences ⋮ Some remarks concerning the M.I.T. public-key cryptosystem ⋮ Odd orders in Shor's factoring algorithm ⋮ A generic approach to searching for Jacobians ⋮ Riemann's hypothesis and tests for primality ⋮ Factoring with hints ⋮ A deterministic algorithm for integer factorization ⋮ Speeding up the computations on an elliptic curve using addition-subtraction chains ⋮ New Cullen Primes ⋮ An exponent one-fifth algorithm for deterministic integer factorisation ⋮ An improved Monte Carlo factorization algorithm ⋮ Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors ⋮ Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules ⋮ Factoring numbers in O(log n) arithmetic steps ⋮ A note on Girault's self-certified model ⋮ Cryptanalysis of Rédei- and Dickson permutations on arbitrary finite rings ⋮ Несколько замечаний о задаче дискретного логарифмирования на эллиптических кривых ⋮ Large-Order Multiple Recursive Generators with Modulus 231 − 1 ⋮ Prime-number algorithm for public-key systems ⋮ Sequences of numbers generated by addition in formal groups and new primality and factorization tests ⋮ Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli ⋮ Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one ⋮ A Subfield Lattice Attack on Overstretched NTRU Assumptions ⋮ Computing prime divisors in an interval ⋮ Factoring with Cyclotomic Polynomials ⋮ Factorization of the tenth Fermat number ⋮ A deterministic algorithm for finding \(r\)-power divisors ⋮ Strong pseudoprimes to base 2 ⋮ A Reduction of Integer Factorization to Modular Tetration ⋮ Faster deterministic integer factorization ⋮ Factoring on a computer ⋮ An Overview of Factoring ⋮ Prime Factorization without Using Any Approximations
This page was built for publication:
