214 Followers
27 Following
394 Posts
{h,cr,sl}acker πŸ’ΎπŸ΄β€β˜ οΈ
https://backrooms.quest β‰ˆ https://windows98.website
xero.stylehttps://xero.style
x-e.rohttps://x-e.ro
0w.nzhttps://0w.nz
windows98.computerhttp://www.windows98.computer
what? you dont put gifs in your prs?

https://leviathan.3xi.club

made a little demo site for my crypto lib. web file encryption, chat, and cli tools

leviathan-crypto

shoutout to bunjs! these single-file executable bins are so hype! watch me install my new crypto lib and build the cli tool in under 0.1s, then watch my demo tool use XChaCha20Poly1305 to encrypt and decrypt a 1gb file in 2s ;D

typescript and wasm in the shell? yes indeed.

https://github.com/xero/leviathan-crypto

v1 (and 2 stream ciphers) were not fast enough. so let's use worker pools! serpent-256 x4 faster! and pooling XChaCha20-Poly1305 makes the tool ridiculous. testing on a 1.3gb file, 2.4sec encrypt or decrypt.
wasm is so hype!
#crypto #wasm #typescript #asciiart #teminal
what good is a cli tool w/o an ascii art animation? esp when encrypting gigs of "backups" ;D

@vitonsky The honest answer is: no cryptographic primitive is proof against a compromised spec. What you can do is prefer primitives where:

- The constant derivation is transparent and independently reproducible
- The design process was public with adversarial review
- The security margin is large enough to survive unknown weaknesses (hence Serpent's 32 rounds vs AES's 10–14)

The library's conservative primitive choices aren't paranoia theater, Serpent's security margin philosophy is directly a hedge against "what if AES has structural weakness we don't know about yet."

@vitonsky "What if the spec was compromised at publication?" this is the real and legitimate question, and it has real history. Dual EC DRBG is the canonical example: an NSA-backdoored PRNG that NIST standardized in 2006, which Snowden documents confirmed was intentionally weakened. The backdoor was in the constants, specific elliptic curve points that were "chosen" in ways that gave the NSA a shortcut.

This is exactly why Serpent's constant selection matters and why the library documents it. Serpent's S-boxes come from a published derivation procedure, they're not arbitrary. The nothing-up-my-sleeve numbers are verifiable. The AES competition process was public, with multiple independent teams. SHA-2/SHA-3 constants are derived from cube roots of primes, you can easily verify them yourself from scratch.

@vitonsky Occam's razor: this is kind of a misread of what vector verification does. KAT vectors aren't about assuming no conspiracy. They're about proving this implementation matches this specification. That's a mathematical claim, not a trust claim. The spec could be evil and the vectors would still prove implementation fidelity. Those are orthogonal.
@vitonsky during my research and planning phase if I cannot find authoritative answers, EG there are multiple conflicting vectors for the same primitive, I probably would not implement that primitive because Id be unable to verify accuracy. full transparency, that is not come up though in anything I've done.
@vitonsky I'm using the same logic principal as textual criticism for old books. multiple attestation. if you have multiple independent sources all saying the same thing that's correlative evidence. The opposite of that is also true. and both are important signals to watch.