Computational Number Theory and Cryptography

Preda Mihăilescu () and Michael Th. Rassias ()
Additional contact information
Preda Mihăilescu: Mathematisches Institut der Universität Göttingen
Michael Th. Rassias: ETH-Zürich

A chapter in Applications of Mathematics and Informatics in Science and Engineering, 2014, pp 349-373 from Springer

Abstract: Abstract This is a succinct survey of the development of cryptography with accent on the public key age. The paper is written for a general, technically interested reader. We also review some fundamental mathematical ideas of computational number theory that play an important role in present time cryptography.

Keywords: Computational number theory; Cryptography; Elliptic curves over finite fields; Diffie-Hellman algorithm; 11Y11; 11G05; 11Y16; 11Y40; 68Q17; 68Q25 (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-04720-1_22

Ordering information: This item can be ordered from
http://www.springer.com/9783319047201

DOI: 10.1007/978-3-319-04720-1_22

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().