The following pages link to (Q5317673):
Displaying 50 items.
- Quantum computation and quantum information (Q252779) (← links)
- Even faster integer multiplication (Q306687) (← links)
- On the number of strong primes (Q313427) (← links)
- On Williams numbers with three prime factors (Q387420) (← links)
- Computing Dirichlet character sums to a power-full modulus (Q401979) (← links)
- On sharp transitions in making squares (Q431647) (← links)
- Proof of three conjectures on congruences (Q477280) (← links)
- Prime chains and Pratt trees (Q607663) (← links)
- Binomial coefficients, Catalan numbers and Lucas quotients (Q625839) (← links)
- Deterministic primality tests based on tori and elliptic curves (Q661993) (← links)
- Codes correcting restricted errors (Q670208) (← links)
- Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm (Q681960) (← links)
- On powersmooth numbers (Q681963) (← links)
- On the generating functions of Mersenne and Fermat primes (Q692048) (← links)
- An algorithm for counting smooth integers (Q726419) (← links)
- Note on a construction of short \(k\)-radius sequences (Q729784) (← links)
- Montgomery's method of polynomial selection for the number field sieve (Q745185) (← links)
- Functional graphs of polynomials over finite fields (Q895996) (← links)
- The least modulus for which consecutive polynomial values are distinct (Q897532) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- Pi on earth, or mathematics in the real world (Q948981) (← links)
- On the effectiveness of a generalization of Miller's primality theorem (Q964923) (← links)
- A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm (Q968774) (← links)
- On zeros of exponential polynomials and quantum algorithms (Q989909) (← links)
- Computing pairings using \(x\)-coordinates only (Q1009121) (← links)
- On the classification of integers \(n\) that divide \(\varphi(n)+\sigma(n)\) (Q1026879) (← links)
- Computational strategies for the Riemann zeta function (Q1587405) (← links)
- The reciprocal sum of primitive nondeficient numbers (Q1651971) (← links)
- The complexity of primes in computable unique factorization domains (Q1750293) (← links)
- Looking for Fibonacci base-2 pseudoprimes (Q1925592) (← links)
- The distribution of the number of points modulo an integer on elliptic curves over finite fields (Q1941046) (← links)
- Integer factoring and compositeness witnesses (Q2023317) (← links)
- Mechanisation of the AKS algorithm (Q2031415) (← links)
- Orbit counting in polarized dynamical systems (Q2062698) (← links)
- Weak pseudoprimality associated with the generalized Lucas sequences (Q2080457) (← links)
- Tabulating Carmichael numbers \(n=Pqr\) with small \(P\) (Q2093670) (← links)
- Controlled SWAP attack and improved quantum encryption of arbitrated quantum signature schemes (Q2100760) (← links)
- A new primality test for natural integers (Q2112332) (← links)
- Pseudoprimality related to the generalized Lucas sequences (Q2146710) (← links)
- A survey on delegated computation (Q2163976) (← links)
- Tight upper and lower bounds for the reciprocal sum of Proth primes (Q2168698) (← links)
- On some new arithmetic properties of the generalized Lucas sequences (Q2223084) (← links)
- On Balazard, Saias, and Yor's equivalence to the Riemann hypothesis (Q2258962) (← links)
- Prime simplicity (Q2268042) (← links)
- A primality test for \(4Kp^n-1\) numbers (Q2287882) (← links)
- Polynomial evaluation and interpolation on special sets of points (Q2387413) (← links)
- Highly parallel modular multiplier for elliptic curve cryptography in residue number system (Q2399132) (← links)
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field (Q2430982) (← links)
- Modulated string searching (Q2437743) (← links)
- On practical aspects of the Miller-Rabin primality test (Q2442488) (← links)
