Modular arithmetic, groups, finite fields and probability

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Much of this book will be spent looking at the applications of modular arithmetic, since it is fundamental to modern cryptography and public key cryptosystems in particular. Hence, in this chapter we introduce the basic concepts and techniques we shall require.

Cite

CITATION STYLE

APA

Smart, N. P. (2016). Modular arithmetic, groups, finite fields and probability. In Information Security and Cryptography (Vol. 0, pp. 3–25). Springer International Publishing. https://doi.org/10.1007/978-3-319-21936-3_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free