APPLICATION OF DIOPHANTINE EQUATIONS IN A CIPHER SYSTEM | ||||
| The International Conference on Electrical Engineering | ||||
| Article 30, Volume 1, 1st International Conference on Electrical Engineering ICEENG 1998, March 1998, Page 313-324 PDF (2.06 MB) | ||||
| Document Type: Original Article | ||||
| DOI: 10.21608/iceeng.1998.61085 | ||||
 View on SCiNiTO | ||||
| Authors | ||||
| M. S. IBRAHIM1; F. S. ABD RABOU2; H. Y. ZORKTA3 | ||||
| 1Ass. Prof., Computer Dep., Military Technical College, Cairo, Egypt. | ||||
| 2Chairman of Computer Dep., Military Technical College, Cairo, Egypt. | ||||
| 3Ph.D. Candidate, Computer Dep. Military Technical College, Cairo, Egypt. | ||||
| Abstract | ||||
| In this paper an algorithm for data security within computer networks is introduced. The algorithm is based on a public key cipher system and Diophantine equations. In order to reduce the possibility of message length prediction, the algorithm is improved by using dummy bits technique. Moreover, some mathematical rules are applied to limit the length of the ciphering key. For the problem of truncation in floating point type representation of numbers, a proposed solution for a very long integer type representation is introduced. | ||||
| Keywords | ||||
| Data Security; Cipher system; Public key; Diophantine equations | ||||
|
Statistics Article View: 84 PDF Download: 262 |
||||
