The aim of the course is to illustrate some of the main cryptographic systems that are historically important or currently in use, with particular regard to the role played in the construction of such systems by algebraic tools such as Modular Arithmetic, Linear Algebra and the theory of finite fields.
Contents
Euclidean algorithm, time estimates. Time estimates for operations in Zm. Symmetric cryptosystems. Finite fields and their order. Public-key ciphers. Use of finite fields in cryptography. RSA system. Elliptic curve cryptosystems. Solovay-Strassen and Miller-Rabin primality tests and pseudoprimality.
Cookies are used to ensure the website works properly. By continuing to browse without changing your browser settings, you agree to receive all cookies. AcceptMore information
Privacy & Cookies Policy
Privacy Overview
This website uses cookies to improve your experience while you navigate through the website. Out of these, the cookies that are categorized as necessary are stored on your browser as they are essential for the working of basic functionalities of the website. We also use third-party cookies that help us analyze and understand how you use this website. These cookies will be stored in your browser only with your consent. You also have the option to opt-out of these cookies. But opting out of some of these cookies may affect your browsing experience.
Necessary cookies are absolutely essential for the website to function properly. This category only includes cookies that ensures basic functionalities and security features of the website. These cookies do not store any personal information.
Any cookies that may not be particularly necessary for the website to function and is used specifically to collect user personal data via analytics, ads, other embedded contents are termed as non-necessary cookies. It is mandatory to procure user consent prior to running these cookies on your website.
