[OT] Can a combinatorial hardware circuit solve a crypto problem?

Georgi Guninski guninski at guninski.com
Fri Oct 3 00:06:09 PDT 2014


On Thu, Oct 02, 2014 at 12:24:17PM -0700, coderman wrote:
> On 10/2/14, Georgi Guninski <guninski at guninski.com> wrote:
> > DISCLAIMER: I am noob at electronics, this is crazy or
> > at best a fishing expedition...
> > ...
> > If you are lucky to hit stable state, you have solved
> > $f(x)=x$.
> 
> what you are describing in a round about way is an adiabatic
> representation of brute force. the jury is out, and certainly not with
> existing fabrication, but potentially 2^64 cost for a 128 bit key.
> this is why TOP SECRET demands 256 bit keys. (also Grover's algorithm,
> among other reasons?)
> 
> "the literature" should be enlightening, given these terms to key on.
> 
> 
> best regards,


Thanks. 

By "existing fabrication" do you mean we can't manufacture 
good enough circuit for this purpose (modulo time 2^64)?
What is considered wire on the circuit in practice is resistor
and the wires will have different resistances which might influence
the unorthodoxal experiment?





More information about the cypherpunks mailing list