A pseudorandom number generator based on worst-case lattice problems

被引：0

作者：

Cayrel, Pierre-Louis ^{[1
]}

Meziani, Mohammed ^{[2
]}

Ndiaye, Ousmane ^{[3
]}

Lindner, Richard ^{[2
]}

Silva, Rosemberg ^{[4
]}

机构：

[1] CNRS, UMR 5516, Lab Hubert Curien, Batiment F 18 Rue Benoit Lauras, F-42000 St Etienne, France

[2] CASED Ctr Adv Secur Res Darmstadt, Mornewegstr, D-64293 Darmstadt, Germany

[3] Univ Cheikh Anta Diop de Dakar, LACGAA, FST, DMI, Dakar, Senegal

[4] Univ Estadual Campinas, UNICAMP, Inst Comp, POB 6176, BR-13084971 Campinas, SP, Brazil

来源：

APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING | 2017年 / 28卷 / 04期

关键词：

Pseudorandom number generator; Lattice-based cryptography; Stream ciphers; GENERALIZED COMPACT KNAPSACKS; SECURE; SCHEMES;

D O I：

10.1007/s00200-017-0323-1

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this paper we construct a pseudorandom number generator using only worst-case hardness assumptions for standard lattice problems. With a common technique, we can then build a stream cipher by combining the generated pseudorandom sequence with the plaintext. Moreover, as an option to gain efficiency both in terms of speed and memory, we suggest the use of ideal lattices in the construction. Currently, there is no known attack that could exploit this choice. Our implementation for Graphics Processing Units leverages from the parallelism inherent in lattice schemes and reaches performances comparable to the fastest known constructions that enjoy security proofs.

引用

页码：283 / 294

页数：12

共 50 条

[1] A pseudorandom number generator based on worst-case lattice problems
Pierre-Louis Cayrel
Mohammed Meziani
Ousmane Ndiaye
Richard Lindner
Rosemberg Silva
[J]. Applicable Algebra in Engineering, Communication and Computing, 2017, 28 : 283 - 294
[2] Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
Kawachi, Akinori
Tanaka, Keisuke
Xagawa, Keita
[J]. ADVANCES IN CRYPTOLOGY - ASIACRYPT 2008, 2008, 5350 : 372 - 389
[3] Lattice signatures using NTRU on the hardness of worst-case ideal lattice problems
Das, Dipayan
Saraswat, Vishal
Basu, Kajla
[J]. IET INFORMATION SECURITY, 2020, 14 (05) : 496 - 504
[4] Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems
Tiegel, Stefan
[J]. THIRTY SIXTH ANNUAL CONFERENCE ON LEARNING THEORY, VOL 195, 2023, 195
[5] An improved worst-case to average-case connection for lattice problems (extended abstract)
Cai, JY
Nerurkar, AP
[J]. 38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, : 468 - 477
[6] A PSEUDORANDOM NUMBER GENERATOR
CLARK, RN
[J]. SIMULATION, 1985, 45 (05) : 252 - 255
[7] A pseudorandom number generator
Clark, R.N.
[J]. 1600, (45):
[8] On domain-partitioning induction criteria: worst-case bounds for the worst-case based
Nock, R
Nielsen, F
[J]. THEORETICAL COMPUTER SCIENCE, 2004, 321 (2-3) : 371 - 382
[9] A Cryptographic Algorithm Based on a Pseudorandom Number Generator
Bucerzan, Dominic
[J]. PROCEEDINGS OF THE 10TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING, 2009, : 453 - 456
[10] Worst-case optimal investment with a random number of crashes
Belak, Christoph
Christensen, Soeren
Menkens, Olaf
[J]. STATISTICS & PROBABILITY LETTERS, 2014, 90 : 140 - 148

← 1 2 3 4 5 →