FPGA Implementation of a Recently Published Signature Scheme

Uloženo v:
Podrobná bibliografie
Název: FPGA Implementation of a Recently Published Signature Scheme
Autoři: Arnaud Tisserand, Cole Normale Suprieure De Lyon, Jean-luc Beuchat, Nicolas Sendrier, Arnaud Tisser, Gilles Villard
Přispěvatelé: The Pennsylvania State University CiteSeerX Archives
Zdroj: http://perso.ens-lyon.fr/gilles.villard/BIBLIOGRAPHIE/POSTSCRIPT/RR2004-14.ps.gz.
Rok vydání: 2004
Sbírka: CiteSeerX
Témata: Cryptography, digital signature, code-based cryptosystems, FPGA implementation Resume
Popis: 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).
Druh dokumentu: text
Popis souboru: application/postscript
Jazyk: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.4371
Dostupnost: 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.
Přístupové číslo: edsbas.C9CFD6B3
Databáze: BASE
Popis
Abstrakt: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).