[HN Gopher] Branchless Coding in Go
       ___________________________________________________________________
        
       Branchless Coding in Go
        
       Author : gnum4n
       Score  : 45 points
       Date   : 2021-05-04 15:26 UTC (7 hours ago)
        
 (HTM) web link (mattnakama.com)
 (TXT) w3m dump (mattnakama.com)
        
       | AlexCoventry wrote:
       | > we have to use if to convert bools into bits.
       | 
       | What if you can use the unsafe package?
        
       | jimktrains2 wrote:
       | I thought TEST did a subtract, setting the appropriate flags and
       | discarded the result?
        
       | movedx wrote:
       | Instead of a "minimum wait", could you implement a random wait?
       | Some random number of ns/ms between calls. Something that's
       | enough to make any timing attack measurements unusable?
        
         | warkdarrior wrote:
         | Random waits only increase the number of measurements an
         | attacker needs to make, they do not eliminate the side-channel
         | leakage. Intuitively the attacker can take many measurements
         | and average them out to eliminate the randomness introduced by
         | the waits, then extract the bits of information from the side
         | channel.
        
       ___________________________________________________________________
       (page generated 2021-05-04 23:00 UTC)