报告题目：No Time to Hash: On Super Efficient Entropy Accumulation
报告人：郭斯瑶 副教授
报告时间：2026年11月6日14:30-15:30
报告地点：科技园阳光楼南815
邀请人：周宏
邀请单位：成人网-成人店老板娘
、福州大学离散数学研究中心
报告内容简介：
Real-world random number generators (RNGs) cannot afford to use (slow) cryptographic hashing every time they refresh their state R with a new entropic input X. Instead, they use "superefficient" simple entropy-accumulation procedures, such as R ← rot_{α,n}(R) ⊕ X, where rot_{α,n} rotates an n-bit state R by some fixed number α.
For example, Microsoft's RNG uses α = 5 for n = 32 and α = 19 for n = 64. Where do these numbers come from? Are they good choices? Should rotation be replaced by a better permutation π of the input bits? In this talk, we aim to provide a rigorous study of these pragmatic questions.
Joint work with Yevgeni Dodis (NYU), Noah Stephens-Davidowitz (Cornell University) and Zhiye Xie (NYU Shanghai).
报告人简介：
郭斯瑶，上海纽约大学计算机科学副教授。主要研究方向包括密码学基础、计算复杂性理论和伪随机性。
