A New Combinational Logic Minimization Technique with Applications to Cryptology-Reference-Cited by-同舟云学术

A New Combinational Logic Minimization Technique with Applications to Cryptology

Published:2010 Issue: Volume: Page:178-189
ISSN:0302-9743
Container-title:Experimental Algorithms
language:
Short-container-title:

Author:

Boyar Joan,Peralta René

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-13193-6_16.pdf

Reference12 articles.

1. Lecture Notes in Computer Science;J. Boyar,2008

2. Boyar, J., Peralta, R.: Tight bounds for the multiplicative complexity of symmetric functions. Theoretical Computer Science 396(1-3), 223–246 (2008)

3. Boyar, J., Peralta, R.: New logic minimization techniques with applications to cryptology. Cryptology ePrint Archive, Report 2009/191 (2009), http://eprint.iacr.org/

4. Boyar, J., Peralta, R.: Patent application number 61089998 filed with the U.S. Patent and Trademark Office. In: A new technique for combinational circuit optimization and a new circuit for the S-Box for AES (2009)

5. Canright, D.: A very compact Rijndael S-box. Technical Report NPS-MA-05-001, Naval Postgraduate School (2005)

Cited by 102 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Toward Finding S-Box Circuits With Optimal Multiplicative Complexity;IEEE Transactions on Computers;2024-08

2. A Framework to Improve the Implementations of Linear Layers;IACR Transactions on Symmetric Cryptology;2024-06-18

3. Quantum Implementation and Analysis of ARIA;2024 Silicon Valley Cybersecurity Conference (SVCC);2024-06-17

4. Unified Lossless-Throughput Architecture for AES and SM4 Encryption with Changeable Keys;2024 IEEE International Symposium on Circuits and Systems (ISCAS);2024-05-19

5. Depth–measurement trade-off for quantum search on block ciphers;Quantum Information Processing;2024-04-16