Reputation
Next privilege 125 Rep.
Vote down
Badges
1
Impact
0 people reached

  • 0 posts edited
  • 0 helpful flags
  • 0 votes cast
Nov
3
comment Should Increment functions be near-constant time?
Note that GCM only increments the counter mod 2^32; non-constant code could reveal when the counter has 8/16/24 low zero bits (but only if the counter is handled at byte granularity). I have just updated the BouncyCastle implementation(s) to do the GCM counter increment without branches (unconditionally i.e. for any value of len(IV)).
Apr
16
awarded  Autobiographer