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 language | English |
|---|---|
| Pages (from-to) | 99-106 |
| Number of pages | 8 |
| Journal | Computers and Mathematics with Applications |
| Volume | 27 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1994 Jan |
All Science Journal Classification (ASJC) codes
- Modelling and Simulation
- Computational Theory and Mathematics
- Computational Mathematics
Fingerprint Dive into the research topics of 'Key generation of algebraic-code cryptosystems'. Together they form a unique fingerprint.
Cite this
Sun, H. M., & Hwang, T. (1994). Key generation of algebraic-code cryptosystems. Computers and Mathematics with Applications, 27(2), 99-106. https://doi.org/10.1016/0898-1221(94)90038-8