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 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Applied Mathematics
- Computational Mathematics
- Modelling and Simulation
Cite this
}
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 journal › Article
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 -