- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Cryptology ePrint Archive, 2010, , S. Report 519
- Event
-
Veröffentlichung
- (where)
-
Mannheim
- (who)
-
Universitätsbibliothek Mannheim
- (when)
-
2010
- Creator
-
Krause, Matthias
Armknecht, Frederik
Fleischmann, Ewan
- URN
-
urn:nbn:de:bsz:180-madoc-351194
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:22 AM CEST
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.
Associated
- Krause, Matthias
- Armknecht, Frederik
- Fleischmann, Ewan
- Universitätsbibliothek Mannheim
Time of origin
- 2010
Other Objects (12)
Permutation-Based Hashing Beyond the Birthday Bound
Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds
Load thresholds for cuckoo hashing with double hashing
Dynamic hashing strategies
Parallel FFT-hashing
Curvature bounds on length-minimizing discs
New Length Bounds for Cycle Bases
Cascading Four Round LRW1 is Beyond Birthday Bound Secure
Design of hashing algorithms
Perfect hashing tree automata
Latent Structure Preserving Hashing
Multiple importance sampling revisited: breaking the bounds
Permutation-Based Hashing Beyond the Birthday Bound
Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds
Load thresholds for cuckoo hashing with double hashing
Dynamic hashing strategies
Parallel FFT-hashing
Curvature bounds on length-minimizing discs
New Length Bounds for Cycle Bases
Cascading Four Round LRW1 is Beyond Birthday Bound Secure
Design of hashing algorithms
Perfect hashing tree automata
Latent Structure Preserving Hashing
Multiple importance sampling revisited: breaking the bounds
Permutation-Based Hashing Beyond the Birthday Bound
Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds
Load thresholds for cuckoo hashing with double hashing
Dynamic hashing strategies
Parallel FFT-hashing
Curvature bounds on length-minimizing discs
New Length Bounds for Cycle Bases
Cascading Four Round LRW1 is Beyond Birthday Bound Secure
Design of hashing algorithms
Perfect hashing tree automata
Latent Structure Preserving Hashing