[PDF] Primality testing revisited | Semantic Scholar
Eurocode ’92
- Eurocode
- 1993
Mathematics, Computer Science
International Centre for Mechanical Sciences
It is shown that the Pettikaan's decoding aLgorithm of some /amities of Gappa codes Cn(D,G) needs at most (g+l) effective divisors if the degree of G is odd and at most Lg/2J+1 effective divisors if…
Pseudoprimes: A Survey of Recent Results
- F. Morain
- 1993
Mathematics, Computer Science
Public key cryptosystems require the use of large prime numbers, numbers with at least 256 bits (80 decimal digits), and one way of dealing with this problem is to use special primes built up using the converse of Fermat's theorem.
On strong pseudoprimes to several bases
- G. Jaeschke
- 1993
Mathematics
With Y'k denoting the smallest strong pseudoprime to all of the first k primes taken as bases we determine the exact values for 5, q6, q7, q8 and give upper bounds for V/9, / W t,' 1 . We discuss the…