搜索结果: 1-2 共查到“密码学 natural proofs”相关记录2条 . 查询时间(0.053 秒)
The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs
foundations / Advanced encryption standard (AES circuit exponential hardness lower bound natural proofs pseudorandom function (PRF) TC^0 Turing machine
2012/3/28
We put forth several simple candidate pseudorandom functions $f_k : \zo^n \to \zo$ with security (a.k.a.~hardness) $2^n$ that are inspired by the AES block-cipher by Daemen and Rijmen (2000). The func...
The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs
foundations / Advanced encryption standard (AES) circuit exponential hardness lower bound natural proofs pseudorandom function (PRF) TC^0 Turing machine
2011/6/8
We put forth several simple candidate pseudorandom functions $f_k : \zo^n \to \zo$ with security (a.k.a.~hardness) $2^n$ that are inspired by the AES block-cipher by Daemen and Rijmen (2000). The func...