Readit News logoReadit News
bascule commented on Are pixie fairies behind Bitcoin's latest bubble?   amycastor.com/2020/11/21/... · Posted by u/amycastor
wmf · 5 years ago
bascule · 5 years ago
It's almost quaint how this December 2019 article talks about "the concern surrounding the creation of large swaths of Tether in 2017", when about $2.5 billion of Tether was issued.

In the time since it was published, when Tether had issued about $4.5 billion total, there have been over $14 billion additional Tether, a 4X expansion of the total supply, or 7.5X what was described as "large swaths of Tether" in this article.

bascule commented on AES-based Synthetic IDs: deterministic AE for 64-bit integers   github.com/iqlusioninc/ae... · Posted by u/beefhash
bob1029 · 6 years ago
This is an interesting approach for primary key obfuscation.

I recently stumbled upon something that I feel might be even more powerful - Hashing complex types into 256-bit keys. E.g. If you had some type representing the composite keys of a Customer in your system (email address, phone number, etc.), you could serialize this instance, run it through SHA256, and as long as the same process is used for lookups, you can get everything back out as expected.

Essentially, you can compress your entire scope of composite key data into a single 256 bit value. Just like with GUID keys, this can be pre-computed on each client (whereas autoincrement cannot). This approach is very clever IMO because it can be used directly on top of any universal byte[]/byte[] key-value store. Your keys are all 256 bit values corresponding to the SHA256 of a serialized complex key instance. The type information can be encoded into the key itself (e.g. hash the fully-qualified type name as well).

bascule · 6 years ago
If you use an unkeyed hash (as opposed to a PRF) on low-entropy inputs, they can be preimaged by an attacker.

This is especially problematic in the case of PII like email address/phone number

bascule commented on AES-based Synthetic IDs: deterministic AE for 64-bit integers   github.com/iqlusioninc/ae... · Posted by u/beefhash
sjnu · 6 years ago
I’m curious what properties this has that aes(0||id) doesn’t.
bascule · 6 years ago
Author here.

You're right (if you add a constant-time check upon decryption that the bits are zero).

I suggested as much here yesterday, and may revise the scheme to do so:

https://www.reddit.com/r/crypto/comments/fyn8cs/aesbased_syn...

bascule commented on Unsoundness in Pin   internals.rust-lang.org/t... · Posted by u/hu3
Rusky · 6 years ago
No, it's bits of valid syntax thrown together informally to express an idea. There is no `!:` in Rust, and that `for` quantification never applies to types or bounds that way.
bascule · 6 years ago
`for` used in a bound (in conjunction with a lifetime) is the syntax for Higher-Rank Trait Bounds (HRTB):

https://doc.rust-lang.org/beta/nomicon/hrtb.html

bascule commented on CRDT: Conflict-free replicated data type   en.wikipedia.org/wiki/Con... · Posted by u/tosh
alexandernst · 6 years ago
This was already posted here some months ago.

https://www.google.com/search?q=hacker+news+crdt

bascule · 6 years ago
Call me crazy but I think CRDTs are interesting enough to deserve a repost
bascule commented on Facebook Libra Is Architecturally Unsound   stephendiehl.com/posts/li... · Posted by u/nuriaion
buboard · 6 years ago
You should submit that
bascule · 6 years ago
Someone else already did. You can find it here: https://news.ycombinator.com/newest
bascule commented on Facebook Libra Is Architecturally Unsound   stephendiehl.com/posts/li... · Posted by u/nuriaion
bascule · 6 years ago
This post is filled with a large number of factual inaccuracies, so numerous I wrote a blog post in response: https://tonyarcieri.com/factual-inaccuracies-of-facebook-lib...
bascule commented on Facebook Libra Is Architecturally Unsound   stephendiehl.com/posts/li... · Posted by u/nuriaion
madrafi · 6 years ago
Would like to point that the work done by the curve25519 team is solid, Henry is also behind the ristretto RFC. The reason Facebook used the BFT algorithm is for pure regulatory purposes (they needed a Blockchain therefore a solid consensus algorithm with failure tolerance). The cryptographic constructions used are quite solid unlike OP claims.
bascule · 6 years ago
The article also incorrectly claims that curve25519-dalek has never had security audits. It's had at least two by reputable cryptography auditing firms (Quarkslab and NCC), the former of which is public (the NCC audit was done at the request of my former employer and is private, but like the Quarkslab audit only found minor issues):

https://blog.quarkslab.com/security-audit-of-dalek-libraries...

bascule commented on Karatsuba Algorithm   en.wikipedia.org/wiki/Kar... · Posted by u/tchalla
bascule · 6 years ago
Here's a real world application of Karatsuba: carryless multiplication of finite field elements for cryptography (universal hashing):

https://github.com/RustCrypto/universal-hashes/blob/master/p...

(note: that function is a bit more than Karatsuba, it also has a modular reduction at the end. I should probably refactor it to make that more clear)

u/bascule

KarmaCake day4104March 12, 2009View Original