Change search
ReferencesLink to record
Permanent link

Direct link
A comparison of reductions from FACT to CNF-SAT
KTH, School of Computer Science and Communication (CSC).
KTH, School of Computer Science and Communication (CSC).
2014 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

The integer factorisation problem (FACT) is a well-known number-theoreticproblem, with many applications in areas such as cryptography. An instanceof a FACT problem (a number n such that n = p × q) can be reduced to aninstance of the conjunctive normal form boolean satisfiability problem (CNFSAT),a well-known NP-complete problem. Some applications of this is toutilize advances in SAT solving for solving FACT, and for creating difficult CNF-SAT instances.This report compares four different reductions from FACT to CNF-SAT,based on the full adder, array multiplier and Wallace tree multiplier circuits.The comparisons were done by reducing a set of FACT instances to CNF-SAT instances with the different reductions. The resulting CNF-SAT instanceswere then compared with respect to the number of clauses and variables, aswell as the time taken to solve the instances with the SAT solver MiniSat.

Place, publisher, year, edition, pages
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-157342OAI: diva2:769762
Available from: 2014-12-09 Created: 2014-12-09 Last updated: 2014-12-09Bibliographically approved

Open Access in DiVA

fulltext(564 kB)96 downloads
File information
File name FULLTEXT01.pdfFile size 564 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
School of Computer Science and Communication (CSC)
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 96 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 218 hits
ReferencesLink to record
Permanent link

Direct link