Hello, guys! I just confirmed the complete and utter detestation of an entire arm of cryptography!? Little applause, come on.... I work hard.. :)
in [Math]
|
Prev: I chose the term "Effective" as nearing the antonym of "Antonym" to fit the string in NP-Crypt
Next: Street grid pattern
From: Turing's Worst Nightmare on 19 May 2010 10:12 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.
From: Turing's Worst Nightmare on 19 May 2010 10:13 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.
From: Ostap Bender on 19 May 2010 18:23
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. I would hope so. But if it is a non-deterministic algorithm, how do you plan to implement it on your computer? |