A Simplification Tool for Expressions over Binary Fields Using Max-SAT Solver
碩士 === 國立臺灣大學 === 電子工程學研究所 === 102 === Efficiency is an important consideration in cryptosystem algorithms implementation. Therefore, a designer has to implement critical part of algorithms in low level languages such as assembly language. Our goal is to automate this human work. The designer can d...
Main Authors: | Wei-Han Chen, 陳韋翰 |
---|---|
Other Authors: | Chen-Mou Chen |
Format: | Others |
Language: | en_US |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/89467093076755827562 |
Similar Items
-
A continuous-time MaxSAT solver with high analog performance
by: Botond Molnár, et al.
Published: (2018-11-01) -
MajorSat: A SAT Solver to Majority Logic
by: Chou, Yu Min, et al.
Published: (2015) -
A hardware SAT solver with efficient BCP
by: Chin-WeiLien, et al.
Published: (2019) -
Attacking RSA moduli with SAT solvers
by: Asketorp, Jonatan
Published: (2014) -
Factoring integers with parallel SAT solvers
by: Lundén, Daniel, et al.
Published: (2015)