A lower bound on the size of ε-free NFA corresponding to a regular expression
- 作者Yuri Lifshits
- 卷第85卷
- 期第6期
- 印刷ISSN0020-0190
- 文件大小109.53KB
- 发表时间2003
- DOI10.1016/s0020-0190(02)00436-2
- 页码293-299
Analysis of generalized Grover quantum search algorithms using recursion equationsBiham, Eli; Biham, Ofer; Biron, David; Grassl, Markus; Lidar, Daniel A.; Shapira, Daniel · Physical Review A · 2000
Grover’s quantum search algorithm for an arbitrary initial amplitude distributionBiham, Eli; Biham, Ofer; Biron, David; Grassl, Markus; Lidar, Daniel A. · Physical Review A · 1999
Quantum computing without entanglementEli Biham; Gilles Brassard; Dan Kenigsberg; Tal Mor · 2004
Cryptanalysis of Multiple Modes of OperationEli Biham · Journal of Cryptology · 1998
Cryptanalysis of Triple Modes of OperationEli Biham · Journal of Cryptology · 1999
Differential cryptanalysis of LuciferIshai Ben-Aroya and Eli Biham · Journal of Cryptology · 1996
Bug AttacksBiham, Eli; Carmeli, Yaniv; Shamir, Adi · Journal of Cryptology · 2016
Efficient Slide AttacksBar-On, Achiya; Biham, Eli; Dunkelman, Orr; Keller, Nathan · Journal of Cryptology · 2017