FPGA Implementation of a Recently Published Signature Scheme

Saved in:
Bibliographic Details
Title: FPGA Implementation of a Recently Published Signature Scheme
Authors: Arnaud Tisserand, Cole Normale Suprieure De Lyon, Jean-luc Beuchat, Nicolas Sendrier, Arnaud Tisser, Gilles Villard
Contributors: The Pennsylvania State University CiteSeerX Archives
Source: http://perso.ens-lyon.fr/gilles.villard/BIBLIOGRAPHIE/POSTSCRIPT/RR2004-14.ps.gz.
Publication Year: 2004
Collection: CiteSeerX
Subject Terms: Cryptography, digital signature, code-based cryptosystems, FPGA implementation Resume
Description: An algorithm producing cryptographic digital signatures less than 100 bits long with a security level matching nowadays standards has been recently proposed by Courtois, Finiasz, and Sendrier. This scheme is based on error correcting codes and consists in generating a large number of instances of a decoding problem until one of them is solved (about 9! = 362880 attempts are needed).
Document Type: text
File Description: application/postscript
Language: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.4371
Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.4371
http://perso.ens-lyon.fr/gilles.villard/BIBLIOGRAPHIE/POSTSCRIPT/RR2004-14.ps.gz
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Accession Number: edsbas.C9CFD6B3
Database: BASE
Description
Abstract:An algorithm producing cryptographic digital signatures less than 100 bits long with a security level matching nowadays standards has been recently proposed by Courtois, Finiasz, and Sendrier. This scheme is based on error correcting codes and consists in generating a large number of instances of a decoding problem until one of them is solved (about 9! = 362880 attempts are needed).