Hochschulschrift
Complexity of the learning with errors problem and memory-efficient lattice sieving
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Bochum, Ruhr-Universität Bochum, Dissertation, 2016
- Classification
-
Mathematik
- Keyword
-
Kryptoanalyse
Gitter (Mathematik)
Euklidischer Raum
Kürzester-Weg-Problem
Gitterpunktproblem
- Event
-
Veröffentlichung
- (where)
-
Bochum
- (who)
-
Ruhr-Universität Bochum
- (when)
-
2017
- Creator
- Contributor
-
May, Alexander
Leander, Nils-Gregor
- URN
-
urn:nbn:de:hbz:294-51027
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:52 PM CET
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.
Object type
- Hochschulschrift
Associated
- Kirshanova, Elena
- May, Alexander
- Leander, Nils-Gregor
- Ruhr-Universität Bochum
Time of origin
- 2017
Other Objects (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