Key generation of algebraic-code cryptosystems

Hung Min Sun, Tzonelih Hwang

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)


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
Issue number2
Publication statusPublished - 1994 Jan

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computational Theory and Mathematics
  • Computational Mathematics


Dive into the research topics of 'Key generation of algebraic-code cryptosystems'. Together they form a unique fingerprint.

Cite this