Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Lecture Notes in Computer Science;J. Boyar,2010
2. Boyar, J., Peralta, R., Pochuev, D.: On the multiplicative complexity of Boolean functions over the basis ( ∧ , ⊕ , 1). Theoretical Computer Science 235, 43–57 (2000)
3. Lecture Notes in Computer Science;D. Canright,2005
4. Canright, D.: A very compact Rijndael S-box. Tech. Rep. NPS-MA-05-001, Naval Postgraduate School (2005)
5. Courtois, N., Hulme, D., Mourouzis, T.: Solving circuit optimisation problems in cryptography and cryptanalysis. IACR Cryptology ePrint Archive 2011, 475 (2011)
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献