Prev: Number of Bits in SSH2 Digital Signature Used for Public Key Authentication?
Next: Binary to decimal ascii converter
From: unruh on 19 May 2010 18:35
On 2010-05-19, Turing's Worst Nightmare <marty.musatov(a)gmail.com> wrote:
> On May 19, 7:12 am, "Turing's Worst Nightmare"
><marty.musa...(a)gmail.com> wrote:
>> A NP algorithm can break any asymmetric cryptographic system that
>> guesses of the secret key ?to decrypt and verify the process, the
>> actual recipient would use the message or efficient.
>
> A NP algorithm can break any asymmetric cryptographic system that
> guesses of the secret key ?to decrypt and verify the process, the
> actual recipient would use the message or efficient.

Addition is NP. But with addition you cannot do much breaking.
Note that exhaustive search is an NP algorithm. Not much use.

 | 
Pages: 1
Prev: Number of Bits in SSH2 Digital Signature Used for Public Key Authentication?
Next: Binary to decimal ascii converter