Paper 2021/051
How Much can F5 Really Do
Jintai Ding, Zheng Zhang, and Joshua Deaton
Abstract
Our purpose is to compare how much the F5 algorithm can gain in efficiency compared to the F4 algorithm. This can be achieve as the F5 algorithm uses the concept of signatures to foresee potential useless computation which the F4 algorithm might make represented by zero rows in the reduction of a large matrix. We experimentally show that this is a modest increase in efficiency for the parameters we tested.
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Keywords
- F4 F5 Experiment Cryptography HFE
- Contact author(s)
- jdeaton1995 @ gmail com
- History
- 2021-01-18: received
- Short URL
- https://ia.cr/2021/051
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/051, author = {Jintai Ding and Zheng Zhang and Joshua Deaton}, title = {How Much can F5 Really Do}, howpublished = {Cryptology {ePrint} Archive, Paper 2021/051}, year = {2021}, url = {https://eprint.iacr.org/2021/051} }