Zobrazeno 1 - 10
of 406
pro vyhledávání: '"Pseudorandom generator theorem"'
Publikováno v:
Gopalan, Parikshit; Kane, Daniel M; & Meka, Raghu. (2018). PSEUDORANDOMNESS VIA THE DISCRETE FOURIER TRANSFORM. SIAM JOURNAL ON COMPUTING, 47(6), 2451-2487. doi: 10.1137/16M1062132. UC San Diego: Retrieved from: http://www.escholarship.org/uc/item/6tj2z2c9
SIAM JOURNAL ON COMPUTING, vol 47, iss 6
FOCS
SIAM Journal on Computing, vol 47, iss 6
SIAM JOURNAL ON COMPUTING, vol 47, iss 6
FOCS
SIAM Journal on Computing, vol 47, iss 6
We present a new approach to constructing unconditional pseudorandom generators against classes of functions that involve computing a linear function of the inputs. We give an explicit construction of a pseudorandom generator that fools the discrete
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2b375eec3ba0a50e1707347f76e1738e
https://doi.org/10.1137/16m1062132
https://doi.org/10.1137/16m1062132
Autor:
Yuchan Qi, Huaning Liu
Publikováno v:
Journal of Number Theory. 181:73-88
Text In a series of papers C. Dartyge and A. Sarkozy (partly with other coauthors) studied pseudorandom measures of subsets. In this paper we extend the theory of C. Dartyge and A. Sarkozy to several dimensions. We introduce measure for multi-dimensi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37ef3a1b238b75436c566de9dce8bab2
https://doi.org/10.1016/j.jnt.2017.05.025
https://doi.org/10.1016/j.jnt.2017.05.025
Publikováno v:
Soft Computing. 22:4335-4346
Due to their nice algebraic structures and pseudorandom features, generalized cyclotomic sequences have wide applications in simulation, coding and cryptography. Based on the Ding–Helleseth sequence, Bai et al. proposed a class of balanced generali
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::685d966e4b9cf1bedd4b23f474e721e1
https://doi.org/10.1007/s00500-017-2870-6
https://doi.org/10.1007/s00500-017-2870-6
Publikováno v:
Applicable Algebra in Engineering, Communication and Computing. 28:283-294
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::523fa3a24e49782cba30124b5d92384d
https://doi.org/10.1007/s00200-017-0323-1
https://doi.org/10.1007/s00200-017-0323-1
Autor:
Michael Mascagni, Asia Aljahdali
Publikováno v:
Monte Carlo Methods and Applications. 23:89-99
Generating pseudorandom numbers is a prerequisite for many areas including Monte Carlo simulation and randomized algorithms. The performance of pseudorandom number generators (PRNGs) depends on the quality of the generated random sequences. They must
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f82ba1ce0793b197472675950ddeedb1
https://doi.org/10.1515/mcma-2017-0105
https://doi.org/10.1515/mcma-2017-0105
Publikováno v:
Journal of Automation and Information Sciences. 49:78-86
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c167376c885607955552aa6786356c1
https://doi.org/10.1615/jautomatinfscien.v49.i3.90
https://doi.org/10.1615/jautomatinfscien.v49.i3.90
Publikováno v:
International Journal of Computers and Applications. 39:45-56
In this paper, a new algorithm along with its first order hardware architecture is proposed to build the pseudorandom non-recursive binary sequence using sequence folding technique to protect the confidential information and data integrity in cryptog
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c3179a03b1059ba9c6dabeb5b432806
https://doi.org/10.1080/1206212x.2016.1262165
https://doi.org/10.1080/1206212x.2016.1262165
Autor:
Xiaojun Tong, Yang Liu
Publikováno v:
IET Information Security. 10:433-441
Pseudorandom sequences are very important in the field of cryptography. The characteristics such as non-linearity and random-like behaviours make chaotic systems suited to generate pseudorandom sequences. However, most of chaos-based pseudorandom num
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::342ec0a2e45323e552c4581bfe37569c
https://doi.org/10.1049/iet-ifs.2015.0024
https://doi.org/10.1049/iet-ifs.2015.0024
Publikováno v:
Information Processing Letters. 116:674-681
Chaotic map is regarded as an important pseudorandom source in the design of pseudorandom bit generators due to its excellent properties, such as unpredictability, randomness, aperiodicity, sensitive dependence on initial conditions and parameters. O
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aac72176a30a0c2fdb7c0b3abbfc0ec6
https://doi.org/10.1016/j.ipl.2016.06.011
https://doi.org/10.1016/j.ipl.2016.06.011
Publikováno v:
Nonlinear Dynamics. 87:407-425
In last years, low-dimensional and high-dimensional chaotic systems have been implemented in cryptography. The efficiency and performance of these nonlinear systems play an important role in limited hardware implementations. In this context, low-dime
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad2abb134888b11aa1d12993b94a382a
https://doi.org/10.1007/s11071-016-3051-3
https://doi.org/10.1007/s11071-016-3051-3