[Cryptography] List of Proven Secure Ciphers / Hashes

[Benjamin Kreuter]

On Wed, 2014-09-10 at 22:48 -0400, Benjamin Kreuter wrote:

> Actually it is easy to factor integers using a SAT solver.  Start with a
> circuit that outputs 1 if N = P*Q and 0 otherwise, with P and Q as
> inputs and N fixed to the integer you want to factor.  Now for each bit
> of P, fix the bit as 0 (leaving the others unknown) and apply your SAT
> solver; now you know which bits of P are 0 i.e. you know the value of P.

(Technicality:  The circuit should actually output a 1 if N=P*Q and
1<P<Q, so that we have a unique solution.  Regardless, it is not hard to
do this.)

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 836 bytes
Desc: This is a digitally signed message part
URL: <http://www.metzdowd.com/pipermail/cryptography/attachments/20140910/edcb892e/attachment.sig>