Krishnamurthy, E. V. ; Ramachandran, Vijaya (1980) A cryptographic system based on finite field transforms Proceedings of the Indian Academy of Sciences - Mathematical Sciences, 89 (2). pp. 75-93. ISSN 0253-4142
|
PDF
- Publisher Version
3MB |
Official URL: http://www.ias.ac.in/j_archive/mathsci/89/2/75-93/...
Related URL: http://dx.doi.org/10.1007/BF02837263
Abstract
In this paper, we develop a cipher system based on finite field transforms. In this system, blocks of the input character-string are enciphered using congruence or modular transformations with respect to either primes or irreducible polynomials over a finite field. The polynomial system is shown to be clearly superior to the prime system for conventional cryptographic work.
Item Type: | Article |
---|---|
Source: | Copyright of this article belongs to Indian Academy of Sciences. |
Keywords: | Ciphers; Computer Data Protection; Cryptography; Finite Field Transforms; Irreducible Polynomials; Military Communication; Polynomial Congruences; Prime Congruences; Public Crypto-systems |
ID Code: | 28202 |
Deposited On: | 15 Dec 2010 12:43 |
Last Modified: | 17 May 2016 11:22 |
Repository Staff Only: item control page