IDENTIFICATION OF THE PARTS OF THE SUM FOR NP-COMPLETE PROBLEMS OF SUBSET-SUM TYPE BY USING A DIGITAL DEVICE

摘要

The invention relates to an electronic device which allows the identification of the parts of the sum for NP complete problems of subset-sum type within the computational complexity theory field, with applications in the cryptography and optimization. According to the invention, the device comprises a cascade module (), a module () for computing the partial sum, a module () for checking the status of the circuit, a module () for generating and synchronizing the clock signal and a module () for storing the status.