搜索结果: 1-7 共查到“军事学 time-memory trade-offs”相关记录7条 . 查询时间(0.092 秒)
Tight Time-Memory Trade-offs for Symmetric Encryption
provable security time-memory trade-offs
font style='font-size:12px;'>
2019/3/6
Concrete security proofs give upper bounds on the attacker's advantage as a function of its time/query complexity. Cryptanalysis suggests however that other resource limitations - most notably, the at...
Speed-ups and time-memory trade-offs for tuple lattice sieving
lattice-based cryptography shortest vector problem (SVP) nearest neighbor algorithms
font style='font-size:12px;'>
2017/12/25
Our results extend and improve upon previous work of Bai-Laarhoven-Stehlé [ANTS'16] and Herold-Kirshanova [PKC'17], with better complexities for arbitrary tuple sizes and offering tunable time-memory ...
Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space
Time-Memory Trade-Offs Proofs of Space Proofs of Work
font style='font-size:12px;'>
2017/9/18
Proofs of space (PoS) were suggested as more ecological and economical alternative to proofs of work, which are currently used in blockchain designs like Bitcoin. The existing PoS are based on rather ...
Time-Memory Trade-offs for Index Calculus in Genus 3
discrete logarithm problem index calculus double large prime
font style='font-size:12px;'>
2016/1/9
In this paper, we present a variant of Diem’s Oe(q) index calculus algorithm to attack
the discrete logarithm problem (DLP) in Jacobians of genus 3 non-hyperelliptic curves over a
finite field Fq. W...
Lyra2: Password Hashing Scheme with improved security against time-memory trade-offs
Password hashing processing time memory usage
font style='font-size:12px;'>
2016/1/4
We present Lyra2, a password hashing scheme (PHS) based
on cryptographic sponges. Lyra2 was designed to be strictly sequential
(i.e., not easily parallelizable), providing strong security even again...
Time-memory Trade-offs for Near-collisions
secret-key cryptography Hash function near-collision
font style='font-size:12px;'>
2013/2/21
In this work we consider generic algorithms to find near-collisions for a hash function. If we consider only hash computations, it is easy to compute a lower-bound for the complexity of near-collision...
Variants of the Distinguished Point Method for Cryptanalytic Time Memory Trade-offs（Full version）
time memory trade-off Hellman trade-off distinguished points
font style='font-size:12px;'>
2009/6/2
The time memory trade-off(TMTO) algorithm, first introduced
by Hellman, is a method for quickly inverting a one-way function,
using pre-computed tables. The distinguished point method (DP) is a
tec...