An improvised version of Hill's cipher

被引：0

作者：

Viswanath, M. K. ^{[1
]}

Deepti, A. R. ^{[1
]}

机构：

[1] Univ Madras, Madras Christian Coll Autonomous, Dept Math, Madras, Tamil Nadu, India

来源：

JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY | 2008年 / 11卷 / 02期

关键词：

Public key; private key; Hill's cipher; Hash function; Diffie-Hellman problem; matrix;

D O I：

10.1080/09720529.2008.10698180

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The rapid change in communication and network technology makes the transfer of information through insecure channel highly vulnerable. Hence, the data security of information transmitted becomes a critical and imperative issue. Towards this direction, we examine the strength and efficiency of a classical cryptographic algorithm namely the Hill's cipher system and its improvisation.

引用

页码：231 / 237

页数：7

共 11 条

[1] Ayres Jr F., 1962, SCHAUMS OUTLINE THEO, P11
[2] Bellare M., 1996, Advances in Cryptology - CRYPTO'96. 16th Annual International Cryptology Conference. Proceedings, P1
[3] Damgard I. B., 1990, ADV CRYPT CRYPT 89 P
[4] NEW DIRECTIONS IN CRYPTOGRAPHY
DIFFIE, W
HELLMAN, ME
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) : 644 - 654
[5] Eisenberg M., 1998, MIMEOGRAPHED NOTES U
[6] Esmonde J., 1999, PROBLEMS ALGEBRAIC N
[7] Hill L. S., 1929, AM MATH MONTHLY, V36, P306
[8] Koblitz, 1994, COURSE NUMBER THEORY
[9] Menezes A., 1997, HDB APPL CRYPTOGRAPH
[10] Rhee, 1994, CRYPTOGRAPHY SECURE

← 1 2 →