Michael Raitza
41c4a51d64
Use MAGIC Algorithms log2 folding to calculate critical bit of the form yyyyxyyyy, where y bits are 1 and x is 0, denoting the critical bit (from the right). Idea from Adam Langley's C example implementation. |
||
---|---|---|
.. | ||
cb-test.factor | ||
cb.factor |