Paper 2023/497 Original: eprint.iacr.org/2023/497 ↗
Upper bounding the number of bent functions using 2-row bent rectangles
Abstract
Using the representation of bent functions by bent rectangles, that is, special matrices with restrictions on columns and rows, we obtain an upper bound on the number of bent functions that improves previously known bounds in a practical range of dimensions. The core of our method is the following fact based on the recent observation by Potapov (arXiv:2107.14583): a 2-row bent rectangle is completely determined by one of its rows and the remaining values in slightly more than half of the columns.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2023-06-01: last updated
- 2023-04-05: published
- Short URL
- https://ia.cr/2023/497
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2023/497,
author = {Sergey Agievich},
title = {Upper bounding the number of bent functions using 2-row bent rectangles},
howpublished = {Cryptology {ePrint} Archive, Paper 2023/497},
year = {2023},
url = {https://eprint.iacr.org/2023/497}
}