Abstract
This chapter introduces some basic mathematical concepts necessary to understand the design of modern cryptographic algorithms and protocols. It begins with definitions of such algebraic structures as groups, rings, and finite fields, followed by some of their applications. This part also includes fundamental number theoretic definitions and properties playing an important role in cryptographic applications: the integer divisibility relation, the greatest common divisor, the least common multiple, the prime numbers, Euler’s totient function, the congruence relation, and their basic properties.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
