A lower bound for differential uniformity by multiplicative complexity & bijective functions of multiplicative complexity 1 over finite fields
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource, 1 online resource.
- Language
-
Englisch
- Bibliographic citation
-
A lower bound for differential uniformity by multiplicative complexity & bijective functions of multiplicative complexity 1 over finite fields ; day:15 ; month:8 ; year:2023 ; pages:1-24
Cryptography and communications ; (15.8.2023), 1-24
- Creator
-
Steiner, Matthias Johann
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s12095-023-00661-3
- URN
-
urn:nbn:de:101:1-2023110310222552606466
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:02 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Steiner, Matthias Johann
- SpringerLink (Online service)
Other Objects (12)
Multiplicative complexity, convolution, and the DFT
Lower spaces of multiplicative lattices
Multiplicative perturbations
Inferring Lower Bounds for Runtime Complexity
Why are Proof Complexity Lower Bounds Hard?
Complexity theoretic lower bounds on cryptographic functions
Mean values of multiplicative functions over multiplicative arithmetical semigroups
Multiplicative background risk
Multiplicative invariant theory
Multiplicative number theory
Multiplicative background risk
Multiplicative number theory
Multiplicative complexity, convolution, and the DFT
Lower spaces of multiplicative lattices
Multiplicative perturbations
Inferring Lower Bounds for Runtime Complexity
Why are Proof Complexity Lower Bounds Hard?
Complexity theoretic lower bounds on cryptographic functions
Mean values of multiplicative functions over multiplicative arithmetical semigroups
Multiplicative background risk
Multiplicative invariant theory
Multiplicative number theory
Multiplicative background risk
Multiplicative number theory
Multiplicative complexity, convolution, and the DFT
Lower spaces of multiplicative lattices
Multiplicative perturbations
Inferring Lower Bounds for Runtime Complexity
Why are Proof Complexity Lower Bounds Hard?
Complexity theoretic lower bounds on cryptographic functions
Mean values of multiplicative functions over multiplicative arithmetical semigroups
Multiplicative background risk
Multiplicative invariant theory
Multiplicative number theory
Multiplicative background risk