Live data from Hacker News

Experimenting with Post-Quantum Cryptography

security.googleblog.com

21–30 of 41 posts

Re: Experimenting with Post-Quantum Cryptography

#21

Upvote for hearing "post-quantum" for the first time in my life. I suspect Deepak Chopra is going to appropriate it soon enough.

When you realize that your soul is already entangled with existence on a quantum level, your consciousness can achieve post-quantum awareness...

I would have lent a pithy rejoinder, but the I don't want to incur further wrath of the down-voters.

Re: Experimenting with Post-Quantum Cryptography

#22
post #5

I discovered NTRU while searching for a fast alternative to RSA for asymmetric encryption. It's said to be quantum resistant as well but I can only vouch for its speed (it is very fast and served my purpose perfectly). https://github.com/NTRUOpenSourceProject/ntru-crypto

It is lattice based so the state of the art to attack it uses LLL lattice reduction, I believe. I wrote a python implementation of both and, with pypy, it is quite fast at encrypting and decrypting. The LLL reduction was rather slow, but impressive that it could be done within a few minutes for some low-rank lattices.

Re: Experimenting with Post-Quantum Cryptography

#24
post #19

Earlier quoted context omitted.

Maybe this is a naive question, not knowing chrome well, but is the source available? Would love to play around with this..

https://github.com/google/boringssl/blob/master/include/open...

and also https://github.com/google/boringssl/blob/master/crypto/newho...

Re: Experimenting with Post-Quantum Cryptography

#25

Upvote for hearing "post-quantum" for the first time in my life. I suspect Deepak Chopra is going to appropriate it soon enough.

Tanja Lange [0] did a talk om post-quantumcrypto @ 32c3 https://media.ccc.de/v/32c3-7210-pqchacks. Last week she organised a 1 day workshop in Utrecht [1]

[0] http://www.hyperelliptic.org/tanja/ [1] https://pqcrypto.eu.org/mini.html

Re: Experimenting with Post-Quantum Cryptography

#28
Are any of these algorithms suited for PGP signing replacements?

I'm interested in being able to make long term claims based on web-of-trust models, and I've been nervous about basing it around RSA/DSA key pairs.

In that sort of world, what do the keys actually look like? Is it comparable to being able to distribute a single public root key?

Re: Experimenting with Post-Quantum Cryptography

#29

Are any of these algorithms suited for PGP signing replacements? I'm interested in being able to make long term claims based on web-of-trust models, and I've been nervous about basing it around RSA/DSA key pairs. In that sort of world, what do the keys actually look like? Is it comparable to being able to distribute a single public root key?

you may want to have a look at sphincs. its security is based on hash-functions, therefore unlike most other postquantum schemes it can be considered very reliable (good hash functions are a solved problem these days). Downside: signatures are big (~40k). For TLS this is unworkable, for a PGP-like system this is doable. https://sphincs.cr.yp.to/
Post reply on HN