Multiplicative Complexity of XOR Based Regular Functions
Author:
Affiliation:
1. Department of Computer Science, Università di Pisa, Pisa, Italy
2. Department of Computer Science, Università degli Studi di Milano, Milano, Italy
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Subject
Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Link
http://xplorestaging.ieee.org/ielx7/12/9913765/09678027.pdf?arnumber=9678027
Reference43 articles.
1. The multiplicative complexity of Boolean functions on four and five variables;turan;Proc 3rd Int Workshop Lightweight Cryptogr Secur Privacy,2014
2. Logic Synthesis for Established and Emerging Computing
3. MPCircuits: Optimized Circuit Generation for Secure Multi-Party Computation
4. On the construction of highly nonlinear permutations;nyberg;Proc 11th Annu Int Conf Theory Appl Cryptogr Techn,1992
5. ESPRESSO-SIGNATURE: a new exact minimizer for logic functions
Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Implementation of a Boolean function with a double-gate vertical TFET (DGVTFET) using numerical simulations;Journal of Computational Electronics;2024-05-23
2. Compact Quantum Circuits for Dimension Reducible Functions;2023 26th Euromicro Conference on Digital System Design (DSD);2023-09-06
3. Autosymmetric and D-reducible Functions: Theory and Application to Security;Advanced Boolean Techniques;2023
4. XOR-AND-XOR Logic Forms for Autosymmetric Functions and Applications to Quantum Computing;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2022
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3