搜索结果: 1-2 共查到“军事学 PRNGs”相关记录2条 . 查询时间(0.046 秒)
We study the problem of devising provably secure PRNGs
with input based on the sponge paradigm. Such constructions are very
appealing, as efficient software/hardware implementations of SHA-3 can
ea...
Secure PRNGs from Specialized Polynomial Maps over Any Fq
sparse multivariate polynomial map hash function provable security
2008/5/23
We prove that a random map drawn from any class C of polynomial maps from (Fq)n to
(Fq)n+r that is (i) totally random in the a ne terms, and (ii) has a negligible chance of being not strongly one-way...