We have several crates which are known to be const time (e.g. aes and serpent), while others are known to perform table indexing based on secret data (e.g. kuznyechik). We should look into each crate implementation and collect this information in crate READMEs (which are also used as crate docs) and in the root README algorithms table.
We have several crates which are known to be const time (e.g.
aesandserpent), while others are known to perform table indexing based on secret data (e.g.kuznyechik). We should look into each crate implementation and collect this information in crate READMEs (which are also used as crate docs) and in the root README algorithms table.