On Sat, Aug 10, 2013 at 08:13:10PM +0200, Mirco Richter wrote:
> AES-256 is considered to be a pqcrypto-hard system.
You also need key negotation, a mode of operation, and a MAC function to
tie it all together.
Cryptography is a very complicated field. You know, a lotta ins, lotta
outs, lotta w
2013/8/10 Mirco Richter :
> say, that from the OBSD POV, the project wants to wait until someone else
> implements such a cypher and has proofen, that the implementation is
> practically as secure as the mathematical model already predicts ?
Yes. Now show us your cypher or go away.
> Gesendet: Samstag, 10. August 2013 um 19:11 Uhr
> Von: Nicolai
> An: misc@openbsd.org
> Betreff: Re: Post-quantum cryptography
>
> On Sat, Aug 10, 2013 at 01:33:11PM +0200, Mirco Richter wrote:
> > Can you please point me to where this is related to OBSD?
>
> I t
On Sat, Aug 10, 2013 at 01:33:11PM +0200, Mirco Richter wrote:
> Can you please point me to where this is related to OBSD?
I think your question as intended was, is the OpenBSD project working on
pqcrypto.
The answer is no: The OpenBSD project does not invent new primitives; it
only implements th
> Gesendet: Samstag, 10. August 2013 um 13:18 Uhr
> Von: "Christian Weisgerber"
> An: misc@openbsd.org
> Betreff: Re: Post-quantum cryptography
>
> Mirco Richter wrote:
>
> > one may think, if it's time to implement a post quantum asymetric key
> &
re even implementations,
> yet?
This--the second hit when you google for "post-quantum cryptography"--
looks like an excellent starting point:
http://pqcrypto.org/
--
Christian "naddy" Weisgerber na...@mips.inka.de
It is long known, that almost all asymetric cyphers that are of practical
importance
today, are easiely broken, using Shor's algorithm
https://en.wikipedia.org/wiki/Shor's_algorithm
which can only run on a "quantum computer". In particular every inverse
logarithm and
prime factorization based c
7 matches
Mail list logo
