Hochschulschrift
Complexity of the learning with errors problem and memory-efficient lattice sieving
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Bochum, Ruhr-Universität Bochum, Dissertation, 2016
- Klassifikation
-
Mathematik
- Schlagwort
-
Kryptoanalyse
Gitter (Mathematik)
Euklidischer Raum
Kürzester-Weg-Problem
Gitterpunktproblem
- Ereignis
-
Veröffentlichung
- (wo)
-
Bochum
- (wer)
-
Ruhr-Universität Bochum
- (wann)
-
2017
- Urheber
- Beteiligte Personen und Organisationen
-
May, Alexander
Leander, Nils-Gregor
- URN
-
urn:nbn:de:hbz:294-51027
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:52 MEZ
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.
Objekttyp
- Hochschulschrift
Beteiligte
- Kirshanova, Elena
- May, Alexander
- Leander, Nils-Gregor
- Ruhr-Universität Bochum
Entstanden
- 2017
Ähnliche Objekte (12)
Errors in Prospective Memory
Towards efficient lattice-based cryptography
Complexity monotone in conditions and future prediction errors
Nonparametric M-estimation with long-memory errors
Nonparametric M-Estimation with Long-Memory Errors
Nonparametric M-estimation with long-memory errors
Local Polynomial Fitting with Long-Memory, Short-Memory and Antipersistent errors
Efficient implementation of ideal lattice-based cryptography
Memory-Efficient Frequent-Itemset Mining
On robust local polynomial estimation with long-memory errors
On robust local polynominal estimation with long-memory errors
On robust local polynomial estimation with long-memory errors
Errors in Prospective Memory
Towards efficient lattice-based cryptography
Complexity monotone in conditions and future prediction errors
Nonparametric M-estimation with long-memory errors
Nonparametric M-Estimation with Long-Memory Errors
Nonparametric M-estimation with long-memory errors
Local Polynomial Fitting with Long-Memory, Short-Memory and Antipersistent errors
Efficient implementation of ideal lattice-based cryptography
Memory-Efficient Frequent-Itemset Mining
On robust local polynomial estimation with long-memory errors
On robust local polynominal estimation with long-memory errors
On robust local polynomial estimation with long-memory errors
Errors in Prospective Memory
Towards efficient lattice-based cryptography
Complexity monotone in conditions and future prediction errors
Nonparametric M-estimation with long-memory errors
Nonparametric M-Estimation with Long-Memory Errors
Nonparametric M-estimation with long-memory errors
Local Polynomial Fitting with Long-Memory, Short-Memory and Antipersistent errors
Efficient implementation of ideal lattice-based cryptography
Memory-Efficient Frequent-Itemset Mining
On robust local polynomial estimation with long-memory errors
On robust local polynominal estimation with long-memory errors