密文分组链接模式的伪随机性分析

Pseudorandom analysis of cipher block chaining model

利用 q阶伪随机检验逻辑和系数 H技术 ,证明了 m次密文分组链接模式伪随机上界可改进为O(q(q - 1) 2 -l)且该模式的伪随机性不依赖于链接次数 m.从而解决了

It was proved that the upper bound of pseudorandomness of \%m\%th order cipher block chaining model was \$ O(m\+2q\+22\+\{-l\})\$ and further developed an open problem that was this upper bound could be more compact to \$O(mq\+22\+\{-l\})\$. We show that \$O(q(q-1)2\+\{-l\}\$ can be achieved by means of \%q\%th\|order pseudorandom test circuit as well as Coefficient H Technology. Thus the open problem is solved.