remcob

11 ms·

61.
by remcob 6y ago
People are working on it. The biggest problem is that cryptography usually requires bignum math and GPUs are not optimized for that. FPGAs are also being researched. The cost/benefit is not as big as you would imagine, CPUs are pretty
62.
by remcob 6y ago
The example is called "Privacy Preserving Search". If the server could see which row was accessed, that would not satisfy the privacy requirement. This implies that each query needs to process all the rows equally (and all in the
63.
by remcob 6y ago
It's odd to have the documentation in a .docx file in the repo. The code itself is not very readable. The core of it is something like (simplified): function mix(uint64 a, uint64 b) { a ^= secret b ^= seed
64.
by remcob 6y ago
> This is a hash designed for non-cryptographic use The Readme specifically says "you can modify it to yield 128-bits or more if you want a cryptographically secure hash." Which is a problematic statement, because it is not des
65.
by remcob 6y ago
Are there any VST containers? Something that will wrap the VST, intercept under-runs or other bad behaviour and substitute some alternative signal (zero, passthrough, etc.). This could also be part of the host software. The article and your
66.
by remcob 6y ago
I'm confused. Supercop is a benchmark for cryptographic hash functions, but SMHasher is a test for non-cryptographic hash functions. The use cases list cryptography, but also universal hash functions which are generally not crypto-grad
67.
by remcob 6y ago
> Before shredders got good. I would expect shredders these days to be easily defeated with a scanner and some clever algorithms. Is that not the case?
68.
by remcob 6y ago
This video does a great job explaining it: https://www.youtube.com/watch?v=Erp8IAUouus The summary is that the USA does not have an official national person identity number. The SSN is the closest approximation, so it is be
69.
by remcob 6y ago
Indeed! And this is not necessarily a downside, sometimes you want to preserve the flags. Intell added the MULX instruction that is similar to MUL, except that it doesn't touch the flags. It's very useful in bignum math.
70.
by remcob 6y ago
In the article, there's a whole path from source to JVM bytecode to ARM assembly. With auxiliary goals like bytecode size. This makes it interesting to include add-double because it has a simple bytecode encoding ('DUP ADD' c
71.
by remcob 6y ago
Adding unsafe can even slowdown your code. The unsafe block prevents the compiler from making certain assumptions, which can prevent some optimizations from happening. 'unsafe' is like telling the compiler 'trust me on this&#
72.
by remcob 6y ago
Another fast way to double a number is to add it to itself.
73.
by remcob 6y ago
There's a nearly identical issue in LLVM [1]. So neither are currently able to handle ADCX/ADOX in their IR and can only support it through inline assembly. I was hoping LLVM could maybe bypass this IR limitation for the iXYZ type
74.
by remcob 6y ago
> or it's own JIT compiler that uses the MULX, ADCX and ADOX instructions. Does LLVM's bigint implementation use those instructions? Last I tried LLVM can not handle the required data-dependencies on individual carry bits, maki
75.
by remcob 6y ago
> Does the compiler guarantee constant time? If not, it's still useless for cryptography. Side-channel resistant algorithms are only required when you are handling sensitive data. This is often not the case when you are verifying si
76.
by remcob 6y ago
Do you have more information on how to do that? Making things resilient against a kilowatt of non-ionizing microwave radiation seems challenging, in my experience it will burn the traces right off the PCB. A different game from the more com
77.
by remcob 6y ago
Creative idea! There are no branches or closures, but the language does allows loops and recursion. These have non-zero cyclomatic complexity. A loop with either 0 or 1 runs is basically an if statement.
78.
by remcob 6y ago
I know it's a joke but: Mugs have a tendency to be put in microwaves, making them a dangerous place for electronics. If you find yourself receiving a questionable mug, time for a glass of warm milk.
79.
by remcob 6y ago
> Physics engine like Bullet or ODE to calculate the simulated trajectories Probably not, the trajectories are simple parabolic and you can assume perfect elastic collision. Easy enough to implement, compared to interfacing with a physic
80.
by remcob 6y ago
> They're like sudoku or crossroads, interesting and somehow intellectually stimulating but they don't help shape/change/modify the world around us. I don't think this is accurate: sudoku and crossroads have dete
81.
by remcob 6y ago
Would be fun to take all this data and interpolate it to all the 16M colours using a natural language model. We'll need this if we want to stand a chance against at ten bit colour depth.
82.
by remcob 6y ago
Yes, but due to lazy-evaluation that won't happen until you do something with the sorted list. Your performance may just blow up in some seemingly unrelated place. My biggest problem with Haskell is how GC and lazy-evaluation makes it
83.
by remcob 6y ago
What's wrong with it?
84.
by remcob 6y ago
The function in Option linked above by steveklabnik has signature fn map_or(self, default: U, f: FnOnce(T) -> U) -> U a fold has the signature fn fold(self, init: U, f: FnMut(U, T) -> U) -> U The difference is
85.
by remcob 7y ago
> Another example are the async/await syntax. Besides the GC that is already mentioned, Haskell has lazy evaluation which gives you coroutines for free. Coroutines are more or less synonymous with async, so in Haskell the implementa
86.
by remcob 7y ago
To match the semantics of a 'fold' the closure would have to receive two arguments: the default value and the Some value. (I don't think Option has such a function, and I don't see why it should.)
87.
by remcob 7y ago
> encode the difference between what is predicted and the actual data Minor nitpick: In the idealized model there is no single prediction that you can take the difference with. There is just a probability distribution and you encode the
88.
by remcob 7y ago
Ah yes, textbook "Embrace, Extend, Extinguish" strategy. Very ironic that GNU now looks like it's following this pattern (obviously unintentionally).
89.
by remcob 7y ago
Due to quarantine remote working, a lot of people are obliged to use Zoom. To some Zoom has a reputation of not taking security seriously, so they feel forced to compromise the security of their computers. Personally I think this reputation
90.
by remcob 7y ago
Download and look at all the examples included with Golly: http://golly.sourceforge.net/ Most amazing topics in CA have an example included, including universal constructors.

More ›