Viewing profile — sweis
sweis
HN member- Joined
- Sun, Jan 18, 2009, 7:49 PM UTC
- HN karma
- 3,313
- Public activity
- 372 items
- HN profile
- View on Hacker News ↗
About sweis
http://saweis.net
Recent public activity
-
comment
Comment #48766306
The NSA is not trying to weaken ML-KEM. The IETF TLS working group is simply trying to publish a pure ML-KEM specification. It does not impact the hybrid ietf-tls-ecdhe-mlkem speci…
-
story
Assessing Claude Mythos Preview's cybersecurity capabilities
Related: Project Glasswing: Securing critical software for the AI era - https://news.ycombinator.com/item?id=47679121 System Card: Claude Mythos Preview [pdf] - https://news.ycombi…
-
comment
Comment #44992401
“ There was a bug in an OpenPGP library which finally gave us an excuse to tear encrypted email via PGP to shreds. Our special guest William Woodruff joined us to help explain the …
- story
-
comment
Comment #42330920
I dug into this once and the "theoretical ideal" of 3 originated in a 1950s paper about vacuum tube computers, which itself immediately backed off and said the choice of base 2 is …
- story
-
comment
Comment #38787238
The video of the talk is online now too: https://www.youtube.com/watch?v=7VWNUUldBEE
-
comment
Comment #38714315
The best estimate I've seen is that we need about 5-7 orders of magnitude more qubits and 1-2 orders of magnitude lower error rates: https://sam-jaques.appspot.com/quantum_landscap…
-
comment
Comment #37768294
Rambus bought Cryptography Research about 12 years ago: https://www.rambus.com/rambus-completes-acquisition-of-crypt...
-
comment
Comment #37758188
NIST P-256 curve seed came from the X9.62 specification drafted in 1997. It was provided by an NSA employee, Jerry Solinas, as an example seed among many other seeds, including tho…
-
comment
Comment #37758169
"High q-bit proprietary technology" and "specialized de-latticing algorithms" are made up terms that nobody uses.
-
comment
Comment #37706959
A post talking about how Jerry Solinas provided the NIST ECDSA curve parameters and anecdotes of how they were chosen.
- story
-
comment
Comment #37409806
NIST post-quantum standards resulted from a 8+ year process and public competition: https://csrc.nist.gov/projects/post-quantum-cryptography
-
comment
Comment #36673524
The record quantum computers can factor is 21 -- and that is by cheating by already knowing the factors are 3 and 7. There are other results that use special form composites which …
-
comment
Comment #36483877
This is appearing at Crypto'23: https://crypto.iacr.org/2023/program.php Video of a previous lecture is here: https://www.youtube.com/watch?v=4xNk3B-4TKs
- story
-
comment
Comment #32021033
Is this using unauthenticated AES-CTR mode? https://github.com/meshtastic/Meshtastic-device/blob/0447808... https://github.com/meshtastic/Meshtastic-device/blob/0447808... https://…
- story
-
comment
Comment #31995210
The record for factoring using a quantum computer is 21. Don't read that as 21 bits. 3*7. This has been the record for 12 years and that is arguably a result that is "cheating" wit…
-
comment
Comment #31533846
Oded Goldreich's "Foundations of Cryptography" books are the rigorous, theoretical oriented books used in many grad-level crypto courses: https://www.wisdom.weizmann.ac.il/~oded/fo…
-
comment
Comment #31323557
You can't just base a business in a QOZ and call it a QOZB. It needs to generate 50% of its gross income from within the zone and 40% of its intangible property (e.g. software) mus…
-
comment
Comment #30277208
I think we are many, many years away from a quantum computer being able to break 256-bit ECC: https://sam-jaques.appspot.com/quantum_landscape https://www.bsi.bund.de/EN/Topics/Cry…
-
comment
Comment #29151976
I don't think QKD is practical, yet there are constantly companies trying to sell it. I don't really understand who is the market -- not big companies and not the US government. Th…
-
comment
Comment #29022374
A quantum computer is not "infinitely parallel" and though it's still an open problem, it's considered unlikely that that quantum computers can solve NP-complete problems in polyno…