2 Contents INTRODUCTION TO NUMBER THEORY PUBLIC-KEYCRYPTOGRAPHY AND RSA OTHER PUBLIC-KEY CRYPTOSYSTEMS
3 1. INTRODUCTION TO NUMBER THEORY Prime NumbersFermat’s and Euler’s TheoremsTesting for PrimalityThe Chinese Remainder TheoremDiscrete Logarithms
4 KEY POINTSA prime number is an integer that can only be divided without remainder by positive and negative values of itself and 1. Prime numbers play a critical role both in number theory and in cryptography.Two theorems that play important roles in public-key cryptography are Fermat’s theorem and Euler’s theorem.
5 KEY POINTS (cont.)An important requirement in a number of cryptographic algorithms is the ability to choose a large prime number. An area of ongoing research is the development of efficient algorithms for determining if a randomly chosen large integer is a prime number.Discrete logarithms are fundamental to a number of public-key algorithms. Discrete logarithms are analogous to ordinary logarithms but are defined using modular arithmetic.
6 2. PUBLIC-KEY CRYPTOGRAPHY AND RSA Principles Of Public-Key CryptosystemsThe RSA Algorithm
7 KEY POINTSAsymmetric encryption is a form of cryptosystem in which encryption and decryption are performed using the different keys—one a public key and one a private key. It is also known as public-key encryption.Asymmetric encryption transforms plaintext into ciphertext using a one of two keys and an encryption algorithm. Using the paired key and a decryption algorithm, the plaintext is recovered from the ciphertext.
8 KEY POINTS (cont.)Asymmetric encryption can be used for confidentiality, authentication, or both.The most widely used public-key cryptosystem is RSA. The difficulty of attacking RSA is based on the difficulty of finding the prime factors of a composite number.
9 Terminology Related to Asymmetric Encryption Asymmetric KeysTwo related keys, a public key and a private key, that are used to perform complementary operations, such as encryption and decryption or signature generation and signature verification.Public Key CertificateA digital document issued and digitally signed by the private key of a Certification Authority that binds the name of a subscriber to a public key. The certificate indicates that the subscriber identified in the certificate has sole control and access to the corresponding private key.
10 Terminology … (cont.) Public Key (Asymmetric) Cryptographic Algorithm A cryptographic algorithm that uses two related keys, a public key and a private key. The two keys have the property that deriving the private key from the public key is computationally infeasible.Public Key Infrastructure (PKI)A set of policies, processes, server platforms, software and workstations used for the purpose of administering certificates and public-private key pairs, including the ability to issue, maintain, and revoke public key certificates.
23 The Security of RSAFour possible approaches to attacking the RSA algorithm areBrute force: This involves trying all possible private keys.Mathematical attacks: There are several approaches, all equivalent in effort to factoring the product of two primes.Timing attacks: These depend on the running time of the decryption algorithm.Chosen ciphertext attacks: This type of attack exploits properties of the RSA algorithm.
29 3. OTHER PUBLIC-KEY CRYPTOSYSTEMS Diffie-Hellman Key ExchangeElgamal Cryptographic SystemElliptic Curve ArithmeticElliptic Curve CryptographyPseudorandom Number Generation Based on an Asymmetric Cipher
30 KEY POINTSA simple public-key algorithm is Diffie-Hellman key exchange. This protocol enables two users to establish a secret key using a public-key scheme based on discrete logarithms. The protocol is secure only if the authenticity of the two participants can be established.Elliptic curve arithmetic can be used to develop a variety of elliptic curve cryptography (ECC) schemes, including key exchange, encryption, and digital signature.For purposes of ECC, elliptic curve arithmetic involves the use of an elliptic curve equation defined over a finite field. The coefficients and variables in the equation are elements of a finite field. Schemes using Zp and GF(2^m) have been developed.