Rounding Theorem the Possibility of Applying the Cryptosystems on the Decimal Numbers
Abstract
The possibility of using the decimal numbers in cryptography as the base of the encryption and decryption is proposed by introducing the "Rounding Theorem". Until now, cryptosystems are used the integer numbers to avoid the fractions of the decimal numbers. That is to avoid losing the original plaintext after the decryption. This theorem is proved that there is no lost for any bit of information during communications when using a cryptosystem that is based on decimal numbers. The purpose of moving from integer numbers to decimal numbers is the decimal numbers are much faster during calculations than the integer numbers. We design a new function called "The Rounding off Function", which plays the primary role in proving this theorem. The security of using the decimal numbers in cryptosystems is studied and analyzed.
DOI: https://doi.org/10.3844/jmssp.2008.15.20
Copyright: © 2008 Rand Alfaris, Muhamad Rezal Kamel Ariffin and Mohamed Rushdan Md Said. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- 3,576 Views
- 2,275 Downloads
- 3 Citations
Download
Keywords
- Rounding off function
- rounding theorem
- decimal numbers