Algorithmic number theory

DOI10.1007/978-3-658-06540-9MaRDI QIDQ2877558zbMATH OpenOpenAlexFDO

Authors Otto Forster

Publication date 22 August 2014

Full work available at URL https://doi.org/10.1007/978-3-658-06540-9

zbMATH Keywords

arithmetic algorithmscontinued fractionselementary number theoryfactorization of integersfast Fourier transformnumber fieldsprimality testing

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Elementary number theory (11Axx) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) 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 2204782
• scientific article; zbMATH DE number 918133
• Prime numbers and computer methods for factorization
• scientific article; zbMATH DE number 2206373
• Number-theoretic algorithms in cryptography. Transl. from the Russian by A. Martsinkovsky

Cited in

(9)

• Arithmetical algorithms for elementary patterns
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 5080964 (Why is no real title available?)
• Arithmetics. A computational approach
• scientific article; zbMATH DE number 1330037 (Why is no real title available?)
• scientific article; zbMATH DE number 1467844 (Why is no real title available?)
• scientific article; zbMATH DE number 918133 (Why is no real title available?)
• scientific article; zbMATH DE number 2204782 (Why is no real title available?)
• scientific article; zbMATH DE number 5263395 (Why is no real title available?)

This page was built for publication: Algorithmic number theory

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