BlueRaja - Danny Pflughoeft
Reputation
521
Top tag
Next privilege 750 Rep.
See vote count; VIP usercard
Badges
3 4
Newest
 Yearling
Impact
~5k people reached

  • 0 posts edited
  • 0 helpful flags
  • 11 votes cast
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"
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?
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
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.
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.