Key generation of algebraic-code cryptosystems

Hung Min Sun, Tzone-Lih Hwang

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

The purpose of this paper is to efficiently generate large nonsingular matrix (S, S-1) pairs and permutation matrices over the binary field using short keys. The motivation of this work is to provide a solution to the long-key problem in algebraic-code cryptosystems. A special class of matrices which have exactly two 1's in each row and each column is defined, and their properties are investigated to facilitate the construction of these algorithms. The time complexities of these algorithms are studied and found to have O(n) n-bit word operations.

Original languageEnglish
Pages (from-to)99-106
Number of pages8
JournalComputers and Mathematics with Applications
Volume27
Issue number2
DOIs
Publication statusPublished - 1994 Jan 1

Fingerprint

Cryptosystem
Cryptography
Permutation Matrix
Nonsingular or invertible matrix
Time Complexity
Binary
Class

All Science Journal Classification (ASJC) codes

  • Applied Mathematics
  • Computational Mathematics
  • Modelling and Simulation

Cite this

@article{3240e4b743b341e69e1c699fb3fb9fbb,
title = "Key generation of algebraic-code cryptosystems",
abstract = "The purpose of this paper is to efficiently generate large nonsingular matrix (S, S-1) pairs and permutation matrices over the binary field using short keys. The motivation of this work is to provide a solution to the long-key problem in algebraic-code cryptosystems. A special class of matrices which have exactly two 1's in each row and each column is defined, and their properties are investigated to facilitate the construction of these algorithms. The time complexities of these algorithms are studied and found to have O(n) n-bit word operations.",
author = "Sun, {Hung Min} and Tzone-Lih Hwang",
year = "1994",
month = "1",
day = "1",
doi = "10.1016/0898-1221(94)90038-8",
language = "English",
volume = "27",
pages = "99--106",
journal = "Computers and Mathematics with Applications",
issn = "0898-1221",
publisher = "Elsevier Limited",
number = "2",

}

Key generation of algebraic-code cryptosystems. / Sun, Hung Min; Hwang, Tzone-Lih.

In: Computers and Mathematics with Applications, Vol. 27, No. 2, 01.01.1994, p. 99-106.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Key generation of algebraic-code cryptosystems

AU - Sun, Hung Min

AU - Hwang, Tzone-Lih

PY - 1994/1/1

Y1 - 1994/1/1

N2 - The purpose of this paper is to efficiently generate large nonsingular matrix (S, S-1) pairs and permutation matrices over the binary field using short keys. The motivation of this work is to provide a solution to the long-key problem in algebraic-code cryptosystems. A special class of matrices which have exactly two 1's in each row and each column is defined, and their properties are investigated to facilitate the construction of these algorithms. The time complexities of these algorithms are studied and found to have O(n) n-bit word operations.

AB - The purpose of this paper is to efficiently generate large nonsingular matrix (S, S-1) pairs and permutation matrices over the binary field using short keys. The motivation of this work is to provide a solution to the long-key problem in algebraic-code cryptosystems. A special class of matrices which have exactly two 1's in each row and each column is defined, and their properties are investigated to facilitate the construction of these algorithms. The time complexities of these algorithms are studied and found to have O(n) n-bit word operations.

UR - http://www.scopus.com/inward/record.url?scp=38149145758&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149145758&partnerID=8YFLogxK

U2 - 10.1016/0898-1221(94)90038-8

DO - 10.1016/0898-1221(94)90038-8

M3 - Article

VL - 27

SP - 99

EP - 106

JO - Computers and Mathematics with Applications

JF - Computers and Mathematics with Applications

SN - 0898-1221

IS - 2

ER -