Sökning: "Erik Villaman Kjellberg"
Hittade 1 uppsats innehållade orden Erik Villaman Kjellberg.
1. FACT- and SAT-solvers on different types of semiprimes
Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)Sammanfattning : This thesis is aimed to cover how boolean satisfiability solvers can be used on integer factorization problems and to compare them with already established integer factorization solvers. The integer factorization problem is believed to be hard and is used in modern day cryptoalgorithms such as RSA. LÄS MER
Resultatsidor:
1