Pages that link to "Item:Q1160213"

The following pages link to Recent developments in primality testing (Q1160213):

Displaying 24 items.

• Even faster integer multiplication (Q306687) (← links)
• Factoring on a computer (Q799723) (← links)
• Number theory and the real world (Q1059655) (← links)
• Carmichael's ``Empirical Theorem'' (Q1071040) (← links)
• The influence of computers in the development of number theory (Q1164656) (← links)
• Miller's primality test (Q1254264) (← links)
• Some algorithms for generation of large prime numbers (Q1276025) (← links)
• Generalized strong pseudoprime tests and applications (Q1582299) (← links)
• Sequences of numbers generated by addition in formal groups and new primality and factorization tests (Q1820186) (← links)
• Primality testing in polynomial time. From randomized algorithms to ``PRIMES is in P''. (Q1882154) (← links)
• Primality testing of large numbers in Maple (Q1903747) (← links)
• A new probabilistic primality test (Q2202823) (← links)
• Zassenhaus conjecture on torsion units holds for \(\mathrm{PSL}(2,p)\) with \(p\) a Fermat or Mersenne prime (Q2419484) (← links)
• On the running time of the Adleman-Pomerance-Rumely primality test (Q2714158) (← links)
• On probable prime testing and the computation of square roots mod \(n\) (Q2739462) (← links)
• On the Stability of m-Sequences (Q3104700) (← links)
• Primality Testing and Jacobi Sums (Q3699757) (← links)
• Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes (Q3828063) (← links)
• (Q3840153) (← links)
• A characterization of nonprime powers (Q4633365) (← links)
• The RSA Cryptography Processor (Q5000236) (← links)
• An Overview of Factoring (Q5019319) (← links)
• (Q5192230) (← links)
• Primality testing (Q5903157) (← links)