DocumentCode :
3431090
Title :
How to generate a random nonsingular matrix in McEliece´s public-key cryptosystem
Author :
Li, Yuan-Xing ; Li, Da-Xing ; Wu, Chuan-Kun
Author_Institution :
Dept. of Inf. Eng., Beijing Univ. of Posts & Telecommun., China
fYear :
1992
fDate :
16-20 Nov 1992
Firstpage :
268
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
Keywords :
encoding; matrix algebra; public key cryptography; random number generation; McEliece´s public-key cryptosystem; algebraic-code cryptosystems; full rank square matrix; random nonsingular matrix; Decoding; Digital signatures; Ear; Error correction codes; Linear code; Polynomials; Public key; Public key cryptography; Telecommunications; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Singapore ICCS/ISITA '92. 'Communications on the Move'
Print_ISBN :
0-7803-0803-4
Type :
conf
DOI :
10.1109/ICCS.1992.254994
Filename :
254994
Link To Document :
بازگشت