4 ms·
This doesn't appear to address the problem. At all. https://paragonie.com/blog/2016/06/constant-time-encoding-boring-cryptography-rfc-4648-and-you https://para
by CiPHPerCoder 10y ago
This doesn't appear to address the problem. At all.
https://paragonie.com/blog/2016/06/constant-time-encoding-boring-cryptography-rfc-4648-and-you https://paragonie.com/blog/2016/06/constant-time-encoding-bo...
- deckar01 10y agoI misread your original comment. Nothing I posted is related to constant time encoding. I apologize for the confusion.
- CiPHPerCoder 10y agoIt's OK. I just want to be clear that my objection to base-122 is the same as my objection to base-N where N != 2^m for some integer m.