Paper 2026/1088
FlipFields-New Building Blocks for Cryptograpic Primitives?
Abstract
$1+1 \equiv 0$---while looking strange at first glance, this is certainly true in GF(2). In this paper we propose the two field-like structures \FlipInts\ and \FlipPolys\ as potential alternative building block for crypographic schemes---in particular in the post-quantum setting. Both structures have $2^d$ elements for some positive integer $d$ and are derived from the natural numbers $N$ in the first case and the univariate polynomial ring GF(2)$[t]$ in the second case. We call the generalization of these two structures FlipFields. In addition, we see examples how they can be used for post-quantum cryptography, in particular Unbalanced Oil and Vinegar, Learning with Errors and Saber. There is also a discussion of cryptographic primitives that are most likely not suitable for FlipFields or at least not easy to tweak. As the structures are very new, this paper also includes a list of OpenProblems.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- Post-Quantum CryptologyFinite FieldsAlternative Foundations
- Contact author(s)
- iacr-eprint @ christopher-wolf de
- History
- 2026-08-10: last of 3 revisions
- 2026-05-28: received
- See all versions
- Short URL
- https://ia.cr/2026/1088
- License
-
CC BY-NC
BibTeX
@misc{cryptoeprint:2026/1088,
author = {Christopher Wolf},
title = {{FlipFields}-New Building Blocks for Cryptograpic Primitives?},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/1088},
year = {2026},
url = {https://eprint.iacr.org/2026/1088}
}
