[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[OT] Can a combinatorial hardware circuit solve a crypto problem?
- To: coderman <[email protected]>
- Subject: [OT] Can a combinatorial hardware circuit solve a crypto problem?
- From: [email protected] (Georgi Guninski)
- Date: Fri, 3 Oct 2014 10:06:09 +0300
- Cc: [email protected]
- In-reply-to: <CAJVRA1TX+sFx0kVrN2NrCwVB_dq=vGzQZ97trLNOUh_EimmDgw@mail.gmail.com>
- References: <[email protected]$> <CAJVRA1TX+sFx0kVrN2NrCwVB_dq=vGzQZ97trLNOUh_EimmDgw@mail.gmail.com>
On Thu, Oct 02, 2014 at 12:24:17PM -0700, coderman wrote:
> On 10/2/14, Georgi Guninski <[email protected]> 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?