๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

McEliece public key cryptosystems using algebraic-geometric codes

โœ Scribed by Heeralal Janwa, Oscar Moreno

Book ID
118771502
Publisher
Springer
Year
1996
Tongue
English
Weight
880 KB
Volume
8
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A symmetric version of the McEliece publ
A symmetric version of the McEliece public-key cryptosystem
โœ A. Kh. Al Jabri ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 95 KB

This article exploits the fact that linear codes can correct twice the number of erasures as that of errors, allowing reduction in code size and providing the same level of security.

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

Key generation of algebraic-code cryptos
Key generation of algebraic-code cryptosystems
โœ Hung-Min Sun; Tzonelih Hwang ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 575 KB

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 whic