搜索结果: 1-15 共查到“pseudorandomness”相关记录15条 . 查询时间(0.046 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Pseudorandomness of Sato-Tate Distributions for Elliptic Curves
椭圆曲线 佐藤-泰特分布 伪随机性
2023/4/13
Equidistribution is an important theme in number theory. The Sato-Tate conjecture, which was established by Richard Taylor et.al. in 2008, asserts that given an elliptic curve over Q without complex m...
Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification
PFG iO
2019/6/4
The existence of secure indistinguishability obfuscators (iO) has far-reaching implications, significantly expanding the scope of problems amenable to cryptographic study. All known approaches to cons...
Pseudorandomness Against Mean and Variance Bounded Attackers
key derivation cryptography with weak keys pseudorandomness
2018/11/5
The recent progress in key derivation (Barak at al. CRYPTO'11, Dodis Yu TCC'2013) introduced the concept of constrained profiles for attackers advantage, recognizing that security bounds can be signif...
Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness
Indistinguishability Obfuscation Functional Encryption
2018/6/25
The existence of secure indistinguishability obfuscators (iO) has far-reaching implications, significantly expanding the scope of problems amenable to cryptographic study. All known approaches to cons...
Pseudorandomness of Ring-LWE for Any Ring and Modulus
Learning with Errors lattice-based cryptography worst-case to average-case reduction
2017/3/27
We give a polynomial-time quantum reduction from worst-case (ideal) lattice problems directly to the decision version of (Ring-)LWE. This extends to decision all the worst-case hardness results that w...
Easing Coppersmith Methods using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness
Coppersmith Methods Analytic Combinatorics Cryptanalysis
2016/1/27
The Coppersmith methods is a family of lattice-based techniques to find small integer
roots of polynomial equations. They have found numerous applications in cryptanalysis and, in recent
development...
Unified Oblivious-RAM: Improving Recursive ORAM with Locality and Pseudorandomness
Oblivious Ram access pattern locality
2016/1/25
Oblivious RAM (ORAM) is a cryptographic primitive that hides memory access patterns to untrusted storage. ORAM may be used in secure processors for encrypted computation and/or software protection. Wh...
Computational extractors are efficient procedures that map a source of sufficiently high min-entropy to an output that is computationally indistinguishable from uniform. By relaxing the statistical cl...
Computational Extractors and Pseudorandomness
foundations/randomness extractors pseudo-randomness
2012/3/20
Computational extractors are efficient procedures that map a source of sufficiently high min-entropy to an output that is computationally indistinguishable from uniform. By relaxing the statistical cl...
We give an explicit construction of a pseudorandom generator for read-once formulas whose inputs can be read in arbitrary order. For formulas in n inputs and arbitrary gates of fan-in at most d = O(n=...
Computational Extractors and Pseudorandomness
foundations / randomness extractors pseudo-randomness
2012/8/28
Computational extractors are efficient procedures that map a source of sufficiently high min-entropy to an output that is computationally indistinguishable from uniform. By relaxing the statistical cl...
In the classical approach to pseudorandom number
generators, a generator is considered to perform well if its output
sequences pass a battery of statistical tests that has h o m e standard.
In rece...
Cryptography, statistics and pseudorandomness. II
Cryptography statistics pseudorandomness
2009/9/22
This paper is a sequel to Brands and Gill [5] which
contained an introduction to the cryptographic theory of random
number generation. Here we give a detailed analysis of the
QR-generator.
Pseudorandomness Analysis of the Lai-Massey Scheme
Pseudorandomness Analysis Lai-Massey Scheme IDEA cipher
2009/6/15
At Asiacrypt’99, Vaudenay modified the structure in the
IDEA cipher to a new scheme, which they called as the Lai-Massey
scheme. It is proved that 3-round Lai-Massey scheme is sufficient for
pseudo...
On the Pseudorandomness of KASUMI Type Permutations
Cryptography block cipher KASUMI pseudorandomness
2009/4/9
KASUMI is a block cipher which has been adopted as a standard of 3GPP.In this paper, we study the pseudorandomness of idealized KASUMI type permutations for adaptive adversaries. We show that• t...