Design and analysis of Rabin-p key encapsulation mechanism for CyberSecurity Malaysia MySEAL initiative
The modular square root problem has a special property of the having computational equivalent to a well-known hard mathematical problem namely integer factorization problem. The proposed Rabin-p Key Encapsulation Mechanism is built upon the said problem as its source of security, aiming for efficien...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Malaysian Society for Cryptology Research (MSCR)
2019
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/81097/1/CYBERSECURITY.pdf http://psasir.upm.edu.my/id/eprint/81097/ https://mscr.org.my/data/journal/journal-20191102142025.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Putra Malaysia |
| Language: | English |
| Summary: | The modular square root problem has a special property of the having computational equivalent to a well-known hard mathematical problem namely integer factorization problem. The proposed Rabin-p Key Encapsulation Mechanism is built upon the said problem as its source of security, aiming for efficient and practical modular square root-based cryptosystem of which accompanied with the following properties; 1) improves the performance without plaintext padding mechanisms or sending extra bits during encryption and decryption processes, 2) the plaintext is uniquely decrypted without decryption failure, 3) improve decryption efficiency by using only one modular exponentiation, 4) a decryption key using only a single prime number, 5) sufficiently large plaintext space, 6) appropriate plaintext-ciphertext expansion ratio, 7) implementable on software and hardware with ease, and 8) achieves IND-CPA security |
|---|