Exploration and Implementation of RSA-KEM Algorithm

Abstract

AbstractCryptography is used to protect information. Encryption and decryption can confirm the confidentiality, integrity of information and protect information from tampering, forgery and counterfeiting. RSA (Rivest, Shamir, Adleman) uses two keys: private key and public key. RSA-KEM (key encapsulation mechanism) is a hybrid encryption algorithm that uses RSA trapdoor permutation along with a key derivation function. RSA is more powerful than other symmetric key algorithms, and its keys are two large randomly generated prime numbers. It is hard to factor a large prime number which is a product of two prime numbers. This paper presents an implementation of a RSA-KEM encryption decryption based on RSA public key algorithm and KEM. RSA contains three functions: key generation, encryption and decryption. In RSA-KEM, password-based key derivation function is used for key stretching. Password, salt and iteration are used for generation of derived key. Advanced encryption standard is used for key-wrapping scheme. AES is a vigorous security algorithm and can be implemented in both hardware and software. It is resilient to hacking attempts due to long key lengths of 128,192 and 256 bits. RSA-KEM creates a random integer ‘r’, manages symmetric encryption key by ‘r’ along key derivation function (KDF) and then encodes ‘r’ with RSA.KeywordsEncryptionDecryptionKey encapsulation mechanismAdvanced encryption standardPrimality testing