Memory-efficient algorithms for solving subset sum and related problems with cryptanalytic applications
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Bochum, Ruhr-Universität Bochum, Dissertation, 2020
- Schlagwort
-
Memory
Algorithms
Kryptologie
Kryptoanalyse
Speicher (Informatik)
Algorithmus
Effizienz
- Ereignis
-
Veröffentlichung
- (wo)
-
Bochum
- (wer)
-
Ruhr-Universität Bochum
- (wann)
-
2020
- Urheber
- Beteiligte Personen und Organisationen
-
May, Alexander
Leander, Nils-Gregor
Fakultät für Mathematik
- URN
-
urn:nbn:de:hbz:294-73984
- 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.
Beteiligte
- Esser, André
- May, Alexander
- Leander, Nils-Gregor
- Fakultät für Mathematik
- Ruhr-Universität Bochum
Entstanden
- 2020
Ähnliche Objekte (12)
Lattice basis reduction : improved practical algorithms and solving subset sum problems
Lattice basis reduction : improved practical algorithms and solving subset sum problems
Quantum algorithms for subset sum under different quantum memory models
Combinatorial algorithms for subset sum problems
Improved low-density subset sum algorithms
The subset sum game revisited
The subset sum game revisited
Solutions for subset sum problems with special digraph constraints
Hypervolume Subset Selection in Two Dimensions: Formulations and Algorithms
Hypervolume Subset Selection in Two Dimensions: Formulations and Algorithms
Optimal subset selection : multiple regression, interdependence and optimal network algorithms
Solving polynomial equations : foundations, algorithms, and applications
Lattice basis reduction : improved practical algorithms and solving subset sum problems
Lattice basis reduction : improved practical algorithms and solving subset sum problems
Quantum algorithms for subset sum under different quantum memory models
Combinatorial algorithms for subset sum problems
Improved low-density subset sum algorithms
The subset sum game revisited
The subset sum game revisited
Solutions for subset sum problems with special digraph constraints
Hypervolume Subset Selection in Two Dimensions: Formulations and Algorithms
Hypervolume Subset Selection in Two Dimensions: Formulations and Algorithms
Optimal subset selection : multiple regression, interdependence and optimal network algorithms
Solving polynomial equations : foundations, algorithms, and applications
Lattice basis reduction : improved practical algorithms and solving subset sum problems
Lattice basis reduction : improved practical algorithms and solving subset sum problems
Quantum algorithms for subset sum under different quantum memory models
Combinatorial algorithms for subset sum problems
Improved low-density subset sum algorithms
The subset sum game revisited
The subset sum game revisited
Solutions for subset sum problems with special digraph constraints
Hypervolume Subset Selection in Two Dimensions: Formulations and Algorithms
Hypervolume Subset Selection in Two Dimensions: Formulations and Algorithms
Optimal subset selection : multiple regression, interdependence and optimal network algorithms