How to generate a random nonsingular matrix in McEliece's public-key cryptosystem

Yuang-Xian Li Yuang-Xian Li,Da-Xing Li Da-Xing Li,Chuan-Kun Wu Chuan-Kun Wu

doi:10.1109/iccs.1992.254994

How to generate a random nonsingular matrix in McEliece's public-key cryptosystem

Yuang-Xian Li Yuang-Xian Li, Da-Xing Li Da-Xing Li + Show 1 more

https://doi.org/10.1109/iccs.1992.254994

Copy DOI

Publication Date: Jan 1, 1992

Citations: 3

Affiliation: Shandong University, Beijing University of Posts and Telecommunications, Xidian University

#McEliece's Public-key Cryptosystem #Public-key Cryptosystem + Show 6 more

Abstract
Full-Text PDF
Similar Papers

Abstract

In the designing of McEliece's (1978) public-key cryptosystem, and other algebraic-code cryptosystems, it is very important to produce a random nonsingular k*k matrix S. For a system designer, how does he fulfill this task of randomly selecting a nonsingular k*k matrix? The present paper discusses the problem, presenting a very simple and effective method of generating a random full-rank k*k matrix. >

Full Text