BlueRaja - Danny Pflughoeft
Reputation
571
Top tag
Next privilege 1,000 Rep.
See votes, expandable usercard
 Oct 5 comment How does RSA compute such enormous numbers? 0.2s vs 5s!? You are vastly underestimating how fast computers do math. The difference is closer to 0.1ms vs 1ms Sep 18 comment Switching between AES and a highly performant algorithm +1 to @MrNerdHair. While "AES-256 is more secure than AES-128" is certainly true, that does not imply that AES-128 is insecure in any way. Using both does not make your app more secure (for the reasons he mentioned), it just creates more opportunities for security-reducing bugs. Jul 13 awarded Autobiographer Mar 27 comment Practical brute-force attack on 128 bit encryption @user40602 If I randomly pick a number between 1 and 10 and ask you to guess it, it will take you 10/2 = 5 tries on average to guess it. Oct 20 comment Is modern encryption needlessly complicated? @CodesInChaos: By "fully understand" I meant "understand it enough to implement it in code," not "understand all its cryptographic properties" Sep 26 revised Is modern encryption needlessly complicated? deleted 10 characters in body Sep 20 answered What is the lowest level of mathematics required in order to understand how encryption algorithms work? Sep 6 awarded Yearling Mar 8 comment What do the magic numbers 0x5c and 0x36 in the opad/ipad calc in HMAC do? Wouldn't just one of the pads have sufficed then? What's the rationale behind having two? Sep 6 awarded Yearling May 16 comment Does the Biclique attack on AES pose a credible risk to its security? @John: That attack reduces the key-strength by two-bits. I would hardly call that a "credible risk." Mar 24 awarded Good Answer Mar 1 comment How are primes generated for RSA? @Vilx- According to the prime number theorem, the distance between prime numbers near x is approximately ln(x). For a 1024-bit number, this is 1024*ln(2), or approximately 710. Thus, checking every odd number near some large 1024-bit number, we'd expect to have to check about 355 numbers to find a prime. For a computer, this is practically nothing. Nov 30 awarded Editor Nov 30 revised Is modern encryption needlessly complicated? added 22 characters in body Oct 24 comment How to require two keyholders to decrypt a document? +1 for Shamir's secret sharing, I was just about to mention this on David's answer. Oct 21 comment Is it feasible to build an index of prime factors? To put things in perspective, there are about \$2^{265}atoms in the known universe. Sep 6 awarded Supporter Sep 6 awarded Teacher Sep 6 awarded Nice Answer