RankSynd a PRNG Based on Rank Metric

Abstract : In this paper, we consider a pseudo-random generator based on the difficulty of the syndrome decoding problem for rank metric codes. We also study the resistance of this problem against a quantum computer. Our results show that with rank metric it is possible to obtain fast PRNG with small public data, without considering additional structure for public matrices like quasi-cyclicity for Hamming distance.
Type de document :
Communication dans un congrès
Tsuyoshi Takagi. Post-Quantum Cryptography - 7th International Workshop, PQCrypto 2016, Feb 2016, Fukuoka, Japan. Springer, 9606, pp.18-28, 2016, Lecture Notes in Computer Science, Post-Quantum Cryptography - 7th International Workshop, PQCrypto 2016. <10.1007/978-3-319-29360-8_2>
Liste complète des métadonnées

https://hal.inria.fr/hal-01289338
Contributeur : Jean-Pierre Tillich <>
Soumis le : mercredi 16 mars 2016 - 15:26:00
Dernière modification le : mardi 13 décembre 2016 - 15:41:28
Document(s) archivé(s) le : dimanche 13 novembre 2016 - 19:52:09

Fichier

Rank_PRNG_finale.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Philippe Gaborit, Adrien Hauteville, Jean-Pierre Tillich. RankSynd a PRNG Based on Rank Metric. Tsuyoshi Takagi. Post-Quantum Cryptography - 7th International Workshop, PQCrypto 2016, Feb 2016, Fukuoka, Japan. Springer, 9606, pp.18-28, 2016, Lecture Notes in Computer Science, Post-Quantum Cryptography - 7th International Workshop, PQCrypto 2016. <10.1007/978-3-319-29360-8_2>. <hal-01289338>

Partager

Métriques

Consultations de
la notice

162

Téléchargements du document

69