zgs

10 ms·

61.
by zgs 3y ago
Linear algebra was one of my favourite series of subjects during my mathematics degrees. It has always been fun. There was only one rocky moment I can recollect, in first year after a three lecture proof which the lecturer finished with wo
62.
by zgs 3y ago
I did expect a title along the lines of: "Hitler predicted global warming decades earlier than the rest of the world".
63.
by zgs 4y ago
Meccano tried licensed IP: Gears of War, Rabbids, Tin Tin, Sonic. Possibly others I don't remember. Lego has more cash and clout to get more desirable IPs with less strict restrictions of course. I think the real reason for the declin
64.
by zgs 4y ago
I'm not all that surprised. Processors add useful new instructions which can easily improve performance. OpenSSL's assembly hasn't changed for years: MD5 isn't really considered secure and hasn't been for years.
65.
by zgs 4y ago
Naturally. If it isn't profitable enough, charge more. Basic economics. Any prior promises can be complete ignored and invalidated.
66.
by zgs 4y ago
It's still a permutation: shuffling a deck of cards again doesn't make it any more random (apologies to Diaconis). A symmetric cipher is just a shuffle -- no more, no less. Sure, it "feels" unlikely that there would be
67.
by zgs 4y ago
You *are* inventing a new crypto algorithm. A symmetric cipher is a permutation, multiple symmetric ciphers in sequence is still a permutation. There has been no analysis done on the latter to determine if the sequence you use hides a weak
68.
by zgs 4y ago
Another example of "roll your own crypto". Just don't. Honestly, just stick to one algorithm and use that. Choose something modern. There is no evidence that AES-256 has problems. CBC mode allows some alteration of the pl
69.
by zgs 4y ago
Well behind the times. Look at Eric's http://www.brouhaha.com/~eric/hpcalc/ which emulators the original ROMs. Any simulator almost certainly lacks the numeric accuracy of the original. I'm the primary
70.
by zgs 4y ago
Add three to six more zeros and these breaches will be taken seriously.
71.
by zgs 4y ago
Absolutely. A large asteroid impact will exterminate us. Being prewired and prepared to avoid that is one racial survival requirement.
72.
by zgs 4y ago
If this works, this is a game changer. Prior to this, such accuracy (albeit a fair bit better to be honest) required a base station and RTK (real time kinematics). Dropping that requirement and getting accuracy within 10cm is amazing.
73.
by zgs 4y ago
Elon: fucking society one fanboy at a time.
74.
by zgs 4y ago
RFC 1149 is worthwhile. It's followup, RFC 2549, rather less so. I've read lots of RFCs over the years and had too implement (too) many.
75.
by zgs 4y ago
Because you don't understand what it is meant to do.
76.
by zgs 4y ago
He's a media whore. Little more and little less. That he's insanely rich is mostly luck and timing, rather than competence.
77.
by zgs 4y ago
Seriously, are the Russians any worse than the US here? I doubt they've got anything like the same level of access to the low level infrastructure (at least outside their borders) and they won't have anything like the budget to sw
78.
Rust
5 points by zgs 4y ago|4 comments
79.
by zgs 4y ago
Bring back Call-by-Name. The one true paradigm.
80.
by zgs 4y ago
Ha ha ha ha ha. This is down to the courts now. Everything else is irrelevant.
81.
by zgs 4y ago
Python and R are the two go to modern programming languages for number crunching. Fortran still has a lot of sway. C has a little. Rust is totally irrelevent in this context.
82.
by zgs 4y ago
Lift controllers date from the 1920's. I'd consider them embedded systems.
83.
by zgs 4y ago
When you are designing for runs of 50k - 1000k units, this is expensive.
84.
by zgs 4y ago
No. At least not with modern caching (or very old page boundary crossings). A constant time implementation has to avoid tables & compute the values directly (and slowly) or take special care to ensure that all of the table is hit/
85.
by zgs 4y ago
Most cryptographic operations are easy to implement. The best part is when you make a mistake, you'll most likely get random nonsense out the end. Floating point code is much more difficult, often you'll get an answer that'
86.
by zgs 4y ago
Compilers that did this would break a lot of the constant time code.
87.
by zgs 4y ago
Most problems I've seen have been in the way OpenSSL is used not in OpenSSL itself. Sure OpenSSL has issues but naïve use of cryptography in the wrong way is *far* more prevalent.
88.
by zgs 4y ago
Not at all. To be vulnerable, you need to build on a non-vulnerable machine which passes the built in tests, then you need to deploy to a vulnerable one and finally you have to not verify that the deployment works. Absolutely not what you a
89.
by zgs 4y ago
If you build on the machine you will deploy to, the tests won't pass. Problem solved. If you build on an earlier machine where the tests pass and deploy to a later one and then don't check that the deployment works, you are at ri
90.
by zgs 4y ago
This would add noise to the measurements which should cause an exploit to take longer but it wouldn't prevent the exploit.

More ›