- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Rostock, Universität Rostock, Dissertation, 2024
- Schlagwort
-
Polynom
Galois-Feld
Kryptologie
- Ereignis
-
Veröffentlichung
- (wo)
-
Rostock
- (wer)
-
Universitätsbibliothek Rostock
- (wann)
-
2025
- Urheber
- Beteiligte Personen und Organisationen
- DOI
-
10.18453/rosdok_id00004733
- URN
-
urn:nbn:de:gbv:28-rosdok_id00004733-8
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:21 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
- Graner, Anna-Maurin
- Kyureghyan, Gohar M.
- Winterhof, Arne
- Universitätsbibliothek Rostock
Entstanden
- 2025
Ähnliche Objekte (12)
A recurrent construction of irreducible polynomials of fixed degree over finite fields
Cryptography and coding : proceedings
Constructing irreducible polynomials recursively with a reverse composition method
Quantum-safe cryptography: crossroads of coding theory and cryptography
Groebner bases, coding, and cryptography
Joint channel coding and cryptography
Cyclotomic numerical semigroup polynomials with at most two irreducible factors
Public key cryptography based on coding theory
Finite automata and application to cryptography
Finite key analysis in quantum cryptography
Finite free convolutions of polynomials
Cryptography and coding : 13th IMA international conference ; proceedings
A recurrent construction of irreducible polynomials of fixed degree over finite fields
Cryptography and coding : proceedings
Constructing irreducible polynomials recursively with a reverse composition method
Quantum-safe cryptography: crossroads of coding theory and cryptography
Groebner bases, coding, and cryptography
Joint channel coding and cryptography
Cyclotomic numerical semigroup polynomials with at most two irreducible factors
Public key cryptography based on coding theory
Finite automata and application to cryptography
Finite key analysis in quantum cryptography
Finite free convolutions of polynomials
Cryptography and coding : 13th IMA international conference ; proceedings
A recurrent construction of irreducible polynomials of fixed degree over finite fields
Cryptography and coding : proceedings
Constructing irreducible polynomials recursively with a reverse composition method
Quantum-safe cryptography: crossroads of coding theory and cryptography
Groebner bases, coding, and cryptography
Joint channel coding and cryptography
Cyclotomic numerical semigroup polynomials with at most two irreducible factors
Public key cryptography based on coding theory
Finite automata and application to cryptography
Finite key analysis in quantum cryptography
Finite free convolutions of polynomials