tveita

78 ms·

841.
by tveita 14y ago
> the prosecutor was seeking decades in Federal prison for punishment. (The idea that she was seeking less punishment has no evidence behind it, and if were true, she wouldn't have needed to add nine extra felony charges a few months ag
842.
by tveita 14y ago
> I expect that any criminal defendant, including Aaron, would read her initial statement as "they're going to put me in prison for 35 years". Absolutely not. I've been shocked to see how many geeks - including Linus, do not seem to und
843.
by tveita 14y ago
If only there were some way to learn from history - then it wouldn't take newly launched services decades to meet basic modern security standards. Seriously, I don't see any comparison between this and a bank robbery. It's not like banks in
844.
by tveita 14y ago
Sounds like a lot of work just to listen to random web traffic. Why not break into Facebook or Gmail instead? Then you could spy on anyone you wanted.
845.
by tveita 14y ago
One technique I use is to search to get focus on the link, and press enter. So for instance, to follow your first link I'd type ".tut[enter]", or for your second, ".tube[enter]" This works in Firefox too, if you dismiss the search box first
846.
by tveita 14y ago
The Android bundles were just bundles that included Android versions of the games. They were still cross-platform and DRM-free (you can use their app, or download the .apk and put it on your device any way you choose) The thing is, people h
847.
by tveita 14y ago
> You mean the movies made about people who were unwavering in real life? Gandhi, MLK, Lincoln are a few high-profile figures that spring to mind, [...] Gandhi actually has some interesting quotes on this topic, e.g. http://www.mkgandh
848.
by tveita 14y ago
Some of the sites at http://urlfind.org/?server-status even keep a session id in the URL -- look for PHPSESSID.
849.
by tveita 14y ago
From what I can see in the referenced talk, Samsung will still only provide binaries for the graphics. https://www.youtube.com/watch?v=LyYXh1V8ov8#t=30m40s
850.
by tveita 14y ago
The rubber-band patent was also the patent asserted to make Motorola Mobility recall their phones in Germany. I don't know how these things work, is the patent invalid in Europe now, or must it be investigated separately? Either way I'm gue
851.
by tveita 14y ago
Valgrind has tools that supposedly can find certain classes of load/store race conditions. I've never used them in anger, so I can't vouch for them, but it would be interesting to do a test on the example in the article. Memcheck is certain
852.
by tveita 14y ago
I tried to find projects or libraries that have implemented the split hashtable, but searching for "split hashtables" gave few relevant results. Does this go by other names?
853.
by tveita 14y ago
This almost works, but the caller will not know when foobar() has deleted the list head, and you update prev_link to the current_node even if you have deleted that node Did you mean: void foobar(Node **prev_link) { Node *c
854.
by tveita 14y ago
This is getting a bit off topic, but: Changing addresses can be dealt with just as it is today: Let logged in users add additional email addresses to their accounts. Other people getting your old email address is a bit worse. The easy solu
855.
by tveita 14y ago
My impression is that people, in the absence of obvious (to them) differences in security, will choose a cryptographic function based on speed, which is simple to understand and quantify. Going by the eBASH benchmarks, software implementati
856.
by tveita 14y ago
To be clear, Apple already did win that case: http://www.guardian.co.uk/technology/2012/sep/14/motorola-mo... Nothing about that makes sense to me, but that's patents for you.
857.
by tveita 14y ago
And in Asia: APNIC initiated last block measures in April last year. http://www.apnic.net/publications/news/2011/final-8
858.
by tveita 14y ago
Compressed Redundancy in Message Exploit?
859.
by tveita 14y ago
> Can someone tell me if it is able to dynamically adapt quality based on available bandwidth? Depends on what you mean. It is a variable bitrate codec, and the encoder can easily adjust the bitrate of the stream. But you would need a w
860.
by tveita 14y ago
Right, but that would be a backdoor in that particular implementation. If you implement RSA yourself, you're safe from backdoors. (With the usual caveats about compilers, operating system and hardware.) The insidious thing about cryptograph
861.
by tveita 14y ago
Not for RSA. It's highly unlikely that anyone has hidden a backdoor in the set of primes. They'd have to solve the RSA problem, which is believed to be difficult. When you do require a "magic constant" in a cryptographic algorithm, it is co
862.
by tveita 14y ago
It was a toy example, it was not meant to capture the exact details of an attack. I didn't ignore the time limit. As long as login attempts are much slower than offline bruteforcing, all that matters is whether we need less attempts total.
863.
by tveita 14y ago
I'll make one more attempt. I don't think I can explain it any clearer than this: http://pastebin.com/MYT9kpgZ Here I model the server as a simple function that takes a password, hashes it, and compares it to a known digest with an '==' s
864.
by tveita 14y ago
Why, yes, it's eminently doable. Even a single byte will let you discard 255 out of 256 attempts, and as you kindly point out, 4 bytes would be enough to uniquely identify almost any word in the standard dictionary. Feel free to peruse some
865.
by tveita 14y ago
> try to imagine a scenario where there could be an operator== timing attack on a password hash Sure, that's simple. You're leaking information about the password hash to the attacker, which they can use to speed up an attack where th
866.
by tveita 14y ago
Though MD5 is considered utterly broken for cryptographic purposes, AFAIK there are as of yet no known practically viable preimage attacks. Finding a collision for an already signed certificate would require a preimage attack. There are ver
867.
by tveita 14y ago
I may be misunderstanding you, but the number of ways to pick 2 out of n dimensions is Θ( n ²). Even if we looked at up to d dimensions, (bruteforceable at Θ( n ^ d )), that doesn't imply we need to generalize to do all 1000. The post you
868.
by tveita 14y ago
Yes, they would appear to contradict each other. What's happening here, I believe, is that neither of the players are actually playing a memory-one game. They extract a result for memory-one games and try to apply it to reason about a memor
869.
by tveita 14y ago
It is true that the most important thing is a good design, which will hopefully get you good performance with minimal and maintainable code. However, in my experience, there are almost always additional optimizations that can be done after
870.
by tveita 14y ago
Hi, The way I look at it is that a database, much like Linux, is a platform. I very seldom look at the source code for either for day to day programming. As popular platforms they have in common that they are very well tested through everyd

More ›