RankSynd a PRNG Based on Rank Metric

被引：10
作者：
Gaborit, Philippe [1 ]
Hauteville, Adrien [1 ,2 ]
Tillich, Jean-Pierre [2 ]
机构：
[1] Univ Limoges, XLIM DMI, 123 Ave Albert Thomas, F-87060 Limoges, France
[2] Inria, BP 105, F-78153 Le Chesnay, France
来源：
POST-QUANTUM CRYPTOGRAPHY, PQCRYPTO 2016 | 2016年 / 9606卷
关键词：
PSEUDORANDOM GENERATOR;
D O I：
10.1007/978-3-319-29360-8_2
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：18 / 28
页数：11
相关论文
共 30 条
[1]  
[Anonymous], LNCS
[2]  
Banerjee A, 2012, LECT NOTES COMPUT SC, V7237, P719, DOI 10.1007/978-3-642-29011-4_42
[3]  
Berbain C, 2006, LECT NOTES COMPUT SC, V4004, P109
[4]   INHERENT INTRACTABILITY OF CERTAIN CODING PROBLEMS [J].
BERLEKAMP, ER ;
MCELIECE, RJ ;
VANTILBORG, HCA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (03) :384-386
[5]  
Bernstein DJ, 2010, LECT NOTES COMPUT SC, V6061, P73, DOI 10.1007/978-3-642-12929-2_6
[6]   A SIMPLE UNPREDICTABLE PSEUDORANDOM NUMBER GENERATOR [J].
BLUM, L ;
BLUM, M ;
SHUB, M .
SIAM JOURNAL ON COMPUTING, 1986, 15 (02) :364-383
[7]   HOW TO GENERATE CRYPTOGRAPHICALLY STRONG SEQUENCES OF PSEUDO-RANDOM BITS [J].
BLUM, M ;
MICALI, S .
SIAM JOURNAL ON COMPUTING, 1984, 13 (04) :850-864
[8]  
Boyer M, 1998, FORTSCHR PHYS, V46, P493, DOI 10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO
[9]  
2-P
[10]  
COURTOIS N, 2001, LNCS, V2248, P402
123