sevenoftwelve

7 ms·

1.
by sevenoftwelve 4mo ago
Hi there, I am Karolin Varner, the person who designed the Rosenpass Protocol, which secures WireGuard against quantum attacks, and I am the managing director of Rosenpass e. V. I am well connected in the real-world cryptography scientific
2.
by sevenoftwelve 4mo ago
Why do the different sha2 variants not share code? This seems like a lot of opportunities for small mistakes/discrepancies; especially considering the many architectures. Was any of this generated using AI?
3.
by sevenoftwelve 4mo ago
Hi @LoadingAlias, > Constant-time MAC, AEAD, and signature verification. That sounds suspiciously incomplete to me. Which cryptographic algorithms in the library are currently not implemented in constant time? Where did the speedup com
4.
by sevenoftwelve 9mo ago
Look, you can't write stuff like that any more. It took me three minutes to figure out you where joking.
5.
by sevenoftwelve 10mo ago
Cryptographer and IACR member with a tiny bit of inside knowledge here. To me, the entire matter is mostly amusing; the negative impact on IACR is pretty low. I now have to spend 10-15 minutes voting again. No big deal. It saddens me that M
6.
Beyond Alcubierre: A Tour of Modern Warp-Drive Physics(altpropulsion.com)
10 points by sevenoftwelve 1y ago|0 comments
7.
by sevenoftwelve 2y ago
I don't think so. Using hash functions requires a minimum amount of entropy in the seed. So do the schemes put forward in the article. In particular, these schemes require a relatively high degree of certainty about the amount of entr
8.
by sevenoftwelve 2y ago
The article is interesting, but it misses the most practical and unambiguously safe way to generate streams of random data: Use cryptography. To generate a stream of random data, use a hash function with arbitrary-length output (XOF) such a
9.
Video: Denial of Service against the WireGuard protocol [video](media.ccc.de)
2 points by sevenoftwelve 2y ago|0 comments
10.
by sevenoftwelve 2y ago
I am researching formal methods systems to conduct cryptographic proofs; I think a big issue in that space is having syntax sugar in the core compiler, so I am pursuing ways to move syntactic sugar into a separate macro language. Your post
11.
X-Wing: A post-quantum encryption scheme that wont fail if the Kyber is broken(eprint.iacr.org)
1 points by sevenoftwelve 3y ago|0 comments
12.
by sevenoftwelve 4y ago
I am the Rosenpass author; Rosenpass is an add-on to make WireGuard even more secure. There are certain types of attacks (i.e. those from quantum computers) that could become possible to perform for governments and very large organizations.
13.
by sevenoftwelve 4y ago
Rosenpass author here; Mate, you could just read the code…or give it a try ;) > the WG author seems like he doesn't care about PQC This is plainly not true; WG supports post-quantum security with the use of the PSK mechanism as we d
14.
by sevenoftwelve 4y ago
We are based on the work of Hülsing, Ning, Zimmermann, Weber and Schwabe and in contact with the group. I havn't heard about kuedlki; the slides seem to refer to a reimplementation of the 2020 paper and the go implementation has been s
15.
by sevenoftwelve 4y ago
Rosenpass author here; nope, that is not correct. NIST has elected Kyber as one of the algorithms to standardize and we are using that. As other commenters mentioned (very good info there, thank you all!) the other algorithm we use – Classi
16.
by sevenoftwelve 4y ago
Rosenpass author here; There is a confusion about terminology here I think. Mathematical proofs including cryptography proofs use models simplifying reality; i.e. the real practical system might still be susceptible to attacks despite a pro
17.
by sevenoftwelve 4y ago
Granted, writing things in Rust doesn't exclude the possibility of a buffer overflow entirely. It does help make it much less likely.
18.
by sevenoftwelve 4y ago
Author here; We are :) Rosenpass is a fancy way of generating a PSK for WireGuard.
19.
by sevenoftwelve 4y ago
Rosenpass author here. It does yes. But it is a mitigation, not a real fix. An attacker could still just speed up time. Although not being able to produce a KillPacket for the year three thousand is a good thing :)
20.
by sevenoftwelve 4y ago
Rosenpass author here; I myself am independent, thus funding by NLNet. We have some project participants who are Freelancers; two of my co-authors are employed at research institutes. One of my co authors is employed at MPI-SP. The cookie t
21.
by sevenoftwelve 4y ago
Author of Rosenpass here; Coq is fairly generic; it has a long history and made it possible to write some really cool proofs such as a proof of the four colors theorem, but writing crypto proofs is really hard using Coq. For symbolic verifi
22.
by sevenoftwelve 4y ago
Author here: No, symbolic verification does not protect from buffer overflows. Writing the implementation in Rust does We are investigating ways how to do more formal verification for the implementation itself.
23.
Science Magazine on Me/CFS and Long Covid(science.org)
1 points by sevenoftwelve 4y ago|0 comments
24.
by sevenoftwelve 5y ago
Direct link to the project: https://github.com/adobe/ferrum
25.
Practical Hash Tables for JavaScript and Tests for examples inside documentation(medium.com)
1 points by sevenoftwelve 5y ago|1 comments
26.
by sevenoftwelve 6y ago
Maybe the author just lacks deep editing skills…
27.
by sevenoftwelve 6y ago
Is this AI-generated? And that's why it's called "Deep Literacy"?
28.
by sevenoftwelve 6y ago
Finally, that settles it: ∞ = 3
29.
How I Learned to Stop Fighting the Borrow Checker and Love Dirty Structs(medium.com)
2 points by sevenoftwelve 6y ago|0 comments
30.
with_drop: Rust lib for using a closure as a custom drop function(github.com)
1 points by sevenoftwelve 6y ago|0 comments

More ›