Basic algorithms in number theory

MaRDI QIDQ3615918zbMATH OpenFDO

Authors Stan Wagon, Joe P. Buhler

Publication date 24 March 2009

zbMATH Keywords

algorithmscomplexitycontinued fractionsfactoringmodular equationsprimalityquadratic fields

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Continued fractions (11A55) Quadratic extensions (11R11) Factorization (11Y05) Primality (11Y11) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Continued fraction calculations (number-theoretic aspects) (11Y65)

Recommendations

• scientific article; zbMATH DE number 918133
• scientific article; zbMATH DE number 733559
• scientific article; zbMATH DE number 2123741
• Number-theoretic algorithms in cryptography. Transl. from the Russian by A. Martsinkovsky
• scientific article; zbMATH DE number 3959562

Cited in

(3)

• Arithmetical algorithms for elementary patterns
• Extended Euclidean algorithm and CRT algorithm
• Efficient CM-constructions of elliptic curves over finite fields

This page was built for publication: Basic algorithms in number theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3615918)