✦ LIBER ✦

Key generation of algebraic-code cryptosystems

✍ Scribed by Hung-Min Sun; Tzonelih Hwang

Book ID: 103931362
Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 575 KB
Volume: 27
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(94)90038-8

No coin nor oath required. For personal study only.

✦ Synopsis

The purpose of this paper is to efficiently generate large nonsingular matrix (S, S-l) 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 l'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.

📜 SIMILAR VOLUMES

Public_key cryptosystems based on linear

Public_key cryptosystems based on linear codes

📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 111 KB

The most lethal and most expensive weapon in the Gulf War was the electronic information system deployed by the multinational troops. This information system was large-scale, advanced in technology, strict in organization, and high in operational efficiency, providing the overall, precise, timely, a

The generalization of public key cryptos

The generalization of public key cryptosystem FAPKC4

✍ Renji Tao; Shihua Chen 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 378 KB

Secure Distributed Key Generation for Di

Secure Distributed Key Generation for Discrete-Log Based Cryptosystems

✍ Rosario Gennaro; Stanislaw Jarecki; Hugo Krawczyk; Tal Rabin 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 334 KB

Algebraic properties of cryptosystem PGM

✍ Spyros S. Magliveras; Nasir D. Memon 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 898 KB

Distribution of random session key based

Distribution of random session key based on key-insulated public-key cryptosystems

✍ Lu Hai-jun; Su Yun-xue; Zhu Yue-fei 📂 Article 📅 2005 🏛 Wuhan University 🌐 English ⚖ 399 KB

Decoding Algebraic Geometry Codes by a K

Decoding Algebraic Geometry Codes by a Key Equation

✍ J.I. Farrán 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 142 KB

A new e!ective decoding algorithm is presented for arbitrary algebraic-geometric codes on the basis of solving a generalized key equation with the majority coset scheme of Duursma. It is an improvement of Ehrhard's algorithm, since the method corrects up to half of the Goppa distance with complexity