Topics in computational number theory inspired by Peter L. Montgomery

DOI10.1017/9781316271575MaRDI QIDQ5350281zbMATH OpenOpenAlexFDO

Authors

Publication date 28 August 2017

Full work available at URL https://doi.org/10.1017/9781316271575

Mathematics Subject Classification ID

Cryptography (94A60) Collections of articles of miscellaneous specific interest (00B15) Festschriften (00B30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Proceedings, conferences, collections, etc. pertaining to number theory (11-06) Mathematical problems of computer architecture (68M07) Computational number theory (11Yxx)

Recommendations

• Computational number theory
• Primality testing and integer factorization in public-key cryptography
• Computational Cryptography
• Computational Number Theory and Modern Cryptography
• Number-theoretic algorithms in cryptography. Transl. from the Russian by A. Martsinkovsky

Cited in

(3)

• Finite field arithmetic in large characteristic for classical and post-quantum cryptography
• Quantum computational number theory
• Arithmetic software libraries

This page was built for publication: Topics in computational number theory inspired by Peter L. Montgomery

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