$\texttt{CryptographicEstimators}$: a Software Library for Cryptographic Hardness Estimation

ePrint Report: $\texttt{CryptographicEstimators}$: a Software Library for Cryptographic Hardness Estimation

Andre Esser, Javier Verbel, Floyd Zweydinger, Emanuele Bellini

The estimation of the computational complexity of hard problems is essential for determining secure parameters for cryptographic systems. To date, those estimations are often performed in an ad-hoc manner. This led to a scattered landscape of available estimation scripts, with multiple scripts for the same problem with varying outputs. Overall, this complicates the task of reaching consensus on the hardness of cryptographic …

complexity computational designers eprint report hard information led library problem problems report scripts software systems task