[Cryptography] State of sin (was Re: What to put in a new cryptography course)

[Dave Horsfall]

On Fri, 15 Jul 2016, Arnold Reinhold wrote:

[ Quoting someone else ]

[...]

>       We don’t know if factoring primes or finding discrete logs are 
>       NP-hard because no one has found enough structure in those 
>       problems to embed Turing machines.

> It does have a bearing.  It is just not the straightforward one that you 
> imply.  (That’s a very good explanation of P=NP, BTW, probably the best 
> I’ve ever seen.)

Well, apart from the bit about factoring primes...

-- 
Dave Horsfall DTM (VK2KFU)  "Those who don't understand security will suffer."