RankSynd and PRNG based on rank metric

DOI10.1007/978-3-319-29360-8_2zbMATH Open1405.81025OpenAlexW2295684241MaRDI QIDQ2802599FDOQ2802599

Authors Adrien Hauteville, Jean-Pierre Tillich, Philippe Gaborit 

Publication date 26 April 2016

Published in Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1603.05128

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

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.

Recommendations

• An efficient pseudo-random generator provably as secure as syndrome decoding
• scientific article; zbMATH DE number 1759341
• New technique for decoding codes in the rank metric and its cryptography applications
• Ranksign: an efficient signature algorithm based on the rank metric
• A new encryption scheme based on rank metric codes

Cited In (4)

• An efficient pseudo-random generator provably as secure as syndrome decoding
• Cryptanalysis of the rank preserving signature
• Injective rank metric trapdoor functions with homogeneous errors
• A practical group signature scheme based on rank metric

This page was built for publication: RankSynd and PRNG based on rank metric

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802599)