Title :
On the modified Niederreiter cryptosystem
Author :
Gabidulin, E. ; Ourivski, A. ; Pavlouchkov, V.
Author_Institution :
Moscow Inst. of Phys. & Technol., Russia
Abstract :
In the classical Niederreiter cryptosystem a public key is the r×N matrix Hcr=SH=S[zjxij ], where S is a scrambling r×r matrix, distinct xj∈GF(q)U(∞), and zj∈GF(q)(0). Anyone who wants to send a secret message chooses a plaintext m, ω H(m)⩽t=[(d-1)/2]=[r/2], and calculates the cyphertext as the syndrome c of the code with the parity check matrix Hcr: c=mHTcr. Upon receiving the ciphertext c, the legal user multiplies it by (ST)-1 and applies a fast decoding algorithm to obtain the plaintext m
Keywords :
public key cryptography; Sidelnikov-Shestakov attack; cyphertext; fast decoding algorithm; modified Niederreiter cryptosystem; parity check matrix; plaintext; public key; scrambling r×r matrix; secret message; Decoding; Equations; Erbium; Helium; Law; Legal factors; Parity check codes; Physics; Public key; Public key cryptography;
Conference_Titel :
Information Theory and Networking Workshop, 1999
Conference_Location :
Metsovo
Print_ISBN :
0-7803-5954-2
DOI :
10.1109/ITNW.1999.814357