<P>In this volume one finds basic techniques from algebra and number theory (e.g. congruences, unique factorization domains, finite fields, quadratic residues, primality tests, continued fractions, etc.) which in recent years have proven to be extremely useful for applications to cryptography and co
Elementary number theory, cryptography and codes
β Scribed by M. Welleda Baldoni, Ciro Ciliberto, G.M. Piacentini Cattaneo, Daniele Gewurz
- Publisher
- Springer
- Year
- 2008
- Tongue
- English
- Leaves
- 530
- Series
- Universitext
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Subjects
ΠΠ°ΡΠ΅ΠΌΠ°ΡΠΈΠΊΠ°;Π’Π΅ΠΎΡΠΈΡ ΡΠΈΡΠ΅Π»;
π SIMILAR VOLUMES
<P>In this volume one finds basic techniques from algebra and number theory (e.g. congruences, unique factorization domains, finite fields, quadratic residues, primality tests, continued fractions, etc.) which in recent years have proven to be extremely useful for applications to cryptography and co
In this volume one finds basic techniques from algebra and number theory (e.g. congruences, unique factorization domains, finite fields, quadratic residues, primality tests, continued fractions, etc.) which in recent years have proven to be extremely useful for applications to cryptography and codin
<p><P>In this volume one finds basic techniques from algebra and number theory (e.g. congruences, unique factorization domains, finite fields, quadratic residues, primality tests, continued fractions, etc.) which in recent years have proven to be extremely useful for applications to cryptography and