On Sun, Aug 4, 2013 at 8:30 PM, Peter Vessenes wrote:
> I studied with Jeffrey Hoffstein at Brown, one of the creators of NTRU. He
> told me recently NTRU, which is lattice based, is one of the few (only?)
> NIST-recommended QC-resistant algorithms.
Lamport signatures (and merkle tree variants th
Whoops, I didn't mean to run us down the Quantum Computing debate path.
I was simply using my experience with QCs as a basis for questioning the
conclusion that ECDLP is so much more robust than RSA/factoring
problems. It's possible we would simply be jumping from one burning
bridge to another bu
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA256
On Mon, Aug 5, 2013 at 3:30 AM, Peter Vessenes wrote:
> I studied with Jeffrey Hoffstein at Brown, one of the creators of NTRU. He
> told me recently NTRU, which is lattice based, is one of the few (only?)
> NIST-recommended QC-resistant algorithms.
I studied with Jeffrey Hoffstein at Brown, one of the creators of NTRU. He
told me recently NTRU, which is lattice based, is one of the few (only?)
NIST-recommended QC-resistant algorithms.
We talked over layering on NTRU to Bitcoin last year when I was out that
way; I think such a thing could be
That is a great presentation, thanks for sharing that!
Though I question the validity of the claim that ECC is so much more
secure than RSA (with appropriate keysizes). My experience from
studying quantum computing is that Factoring and DLP are intimately
related, such that a break of one is like
A great presentation on advances in crypto
http://www.slideshare.net/astamos/bh-slides
--
Get your SQL database under version control now!
Version control is standard for application code, but databases havent
caught up.
6 matches
Mail list logo
