Primality testing algorithms [after Adleman, Rumely and Williams]
- 1 January 1981
- book chapter
- Published by Springer Nature
- p. 243-257
- https://doi.org/10.1007/bfb0097201
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Refined analysis and improvements on some factoring algorithmsLecture Notes in Computer Science, 1981
- On distinguishing prime numbers from composite numbersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Cyclotomic FieldsPublished by Springer Nature ,1978
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- Euclid's Algorithm in Cyclotomic FieldsJournal of the London Mathematical Society, 1975
- Theorems on factorization and primality testingMathematical Proceedings of the Cambridge Philosophical Society, 1974
- Separable Algebras Over Commutative RingsLecture Notes in Mathematics, 1971
- ber die Anzahl der Teiler einer nat rlichen Zahl, welche die Formp?1 habenMonatshefte für Mathematik, 1955