A lower bound for differential uniformity by multiplicative complexity & bijective functions of multiplicative complexity 1 over finite fields
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource, 1 online resource.
- Sprache
-
Englisch
- Erschienen in
-
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
- Urheber
-
Steiner, Matthias Johann
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s12095-023-00661-3
- URN
-
urn:nbn:de:101:1-2023110310222552606466
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:02 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Steiner, Matthias Johann
- SpringerLink (Online service)
Ähnliche Objekte (12)
Multiplicative complexity, convolution, and the DFT
Lower spaces of multiplicative lattices
Multiplicative perturbations
Inferring Lower Bounds for Runtime Complexity
Mean values of multiplicative functions over multiplicative arithmetical semigroups
Why are Proof Complexity Lower Bounds Hard?
Complexity theoretic lower bounds on cryptographic functions
Multiplicative background risk
Multiplicative invariant theory
Multiplicative number theory
Multiplicative number theory
Multiplicative background risk
Multiplicative complexity, convolution, and the DFT
Lower spaces of multiplicative lattices
Multiplicative perturbations
Inferring Lower Bounds for Runtime Complexity
Mean values of multiplicative functions over multiplicative arithmetical semigroups
Why are Proof Complexity Lower Bounds Hard?
Complexity theoretic lower bounds on cryptographic functions
Multiplicative background risk
Multiplicative invariant theory
Multiplicative number theory
Multiplicative number theory
Multiplicative background risk
Multiplicative complexity, convolution, and the DFT
Lower spaces of multiplicative lattices
Multiplicative perturbations
Inferring Lower Bounds for Runtime Complexity
Mean values of multiplicative functions over multiplicative arithmetical semigroups
Why are Proof Complexity Lower Bounds Hard?
Complexity theoretic lower bounds on cryptographic functions
Multiplicative background risk
Multiplicative invariant theory
Multiplicative number theory
Multiplicative number theory