搜索结果: 1-15 共查到“密码学 tradeoff”相关记录18条 . 查询时间(0.062 秒)
On designing secure small-state stream ciphers against time-memory-data tradeoff attacks
Stream cipher Ultra-lightweight Small-state
font style='font-size:12px;'>
2019/6/10
A new generation of stream ciphers, small-state stream ciphers (SSCs), was born in 2015 with the introduction of the Sprout cipher. The new generation is based on using key bits not only in the initia...
Distributed Time-Memory Tradeoff Attacks on Ciphers (with Application to Stream Ciphers and Counter Mode)
cryptanalysis time-memory tradeoff attacks block ciphers
font style='font-size:12px;'>
2018/2/3
In this paper, we consider the implications of parallelizing time-memory tradeoff attacks using a large number of distributed processors. It is shown that Hellman’s original tradeoff method and the Bi...
Novel Bypass Attack and BDD-based Tradeoff Analysis Against all Known Logic Locking Attacks
Logic Locking SAT Attack Hardware IP Protection
font style='font-size:12px;'>
2017/6/28
Logic locking has emerged as a promising technique for protecting gate-level semiconductor intellectual property. However, recent work has shown that such gate-level locking techniques are vulnerable ...
Cryptanalytic Time-Memory Tradeoff for Password Hashing Schemes
Time-Memory tradeoff password hashing
font style='font-size:12px;'>
2017/6/26
A cryptanalytic technique known as time-memory tradeoff (TMTO) was proposed by Hellman for finding the secret key of a block cipher. This technique allows sharing the effort of key search between the ...
Time-Memory Tradeoff Attacks on the MTP Proof-of-Work Scheme
Proof-of-work Merkle Tree Proof
font style='font-size:12px;'>
2017/6/2
Proof-of-work (PoW) schemes are cryptographic primitives with numerous applications, and in particular, they play a crucial role in maintaining consensus in cryptocurrency networks. Ideally, a cryptoc...
Time-Memory-Data Tradeoff Attacks against Small-State Stream Ciphers
Stream Ciphers Lightweight Cryptography Time-Memory-Data Tradeoff Attacks
font style='font-size:12px;'>
2017/5/5
Time-memory-data (TMD) tradeoff attacks limit the security level of many classical stream ciphers (like E0E0, A5/1, Trivium, Grain) to 12n12n, where nn denotes the inner state length of the underlying...
On the Hardness of Trivium and Grain with respect to Generic Time-Memory-Data Tradeoff Attacks
Stream Ciphers Time-Memory-Data Tradeoff Attacks Security Lower Bound Proofs
font style='font-size:12px;'>
2017/4/5
Time-Memory-Data tradeoff attacks (TMD-attacks) like those of Babbage, Biryukov and Shamir, and Dunkelman and Keller reduce the security level of keystream generator based-stream ciphers to L/2L/2, wh...
Tradeoff Cryptanalysis of Memory-Hard Functions
password hashing memory-hard Catena
font style='font-size:12px;'>
2016/1/3
We explore time-memory and other tradeoffs for memory-hard functions, which are supposed
to impose significant computational and time penalties if less memory is used than intended. We
analyze three...
Practical Cryptanalysis of Full Sprout with TMD Tradeoff Attacks
LFSR NLFSR guess-and-determine
font style='font-size:12px;'>
2015/12/31
The internal state size of a stream cipher is supposed to be at least twice the key length to provide resistance against the conventional Time-Memory-Data (TMD) tradeoff attacks. This well adopted sec...
Fast and Tradeoff-Resilient Memory-Hard Functions for Cryptocurrencies and Password Hashing
memory-hard cryptocurrency bitcoin tradeoff
font style='font-size:12px;'>
2015/12/30
Memory-hard functions are becoming an important tool in the design of password hashing schemes, cryptocurrencies,
and more generic proof-of-work primitives that are x86-oriented and can not be comput...
Analysis of the Rainbow Tradeoff Algorithm Used in Practice
cryptanalytic time memory tradeoff rainbow tradeoff
font style='font-size:12px;'>
2014/3/10
Cryptanalytic time memory tradeoff is a tool for inverting one-way functions, and the rainbow table method, the best-known tradeoff algorithm, is widely used to recover passwords. Even though extensiv...
A Dynamic Tradeoff Between Active and Passive Corruptions in Secure Multi-Party Computation
Multi-party computation gradual secret sharing
font style='font-size:12px;'>
2014/3/12
At STOC '87, Goldreich et al.~presented two protocols for secure multi-party computation (MPC) among $n$ parties: The first protocol provides \emph{passive} security against $trrupted parties. T...
Analysis of the Parallel Distinguished Point Tradeoff
time memory tradeoff parallel distinguished point distinguished point rainbow table
font style='font-size:12px;'>
2012/3/27
Cryptanalytic time memory tradeoff algorithms are tools for quickly inverting one-way functions and many consider the rainbow table method to be the most efficient tradeoff algorithm. However, it was ...
Analysis of the Parallel Distinguished Point Tradeoff
time memory tradeoff parallel distinguished point distinguished point
font style='font-size:12px;'>
2011/7/25
Cryptanalytic time memory tradeoff algorithms are tools for quickly inverting one-way functions and many consider the rainbow table method to be the most efficient tradeoff algorithm.
A Comparison of Cryptanalytic Tradeoff Algorithms
time memory tradeoff Hellman distinguished point rainbow table randomfunction
font style='font-size:12px;'>
2010/4/7
The three major time memory tradeoff algorithms are compared in this paper.
Specifically, the Hellman tradeoff algorithm, the distinguished point tradeoff method, and
the rainbow table method, in th...