搜索结果: 1-8 共查到“军事学 memory-hard”相关记录8条 . 查询时间(0.109 秒)
Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions
Memory Hard Function Depth-Robust Graph Sustained Space Complexity
2018/11/7
Data-Independent Memory-hard functions (iMHFs) are a key cryptographic primitive underlying the design of moderately expensive password hashing algorithms and egalitarian proofs of work that are resis...
Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling
memory-hard functions pebbling space-time trade-offs
2018/3/5
Pebble games were originally formulated to study time-space tradeoffs in computation, modeled by games played on directed acyclic graphs (DAGs). Close connections between pebbling and cryptography hav...
Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions
Memory Hard Function Password Hashing Data-Independence
2017/5/25
Essentially all iMHFs can be viewed as some mode of operation (making nn calls to some round function) given by a directed acyclic graph (DAG) with very low indegree. Recently, a combinatorial propert...
Memory-hard functions (MHFs) are hash algorithms whose evaluation cost is dominated by memory cost. As memory, unlike computation, costs about the same across different platforms, MHFs cannot be evalu...
Efficiently Computing Data-Independent Memory-Hard Functions
Memory Hard Function Password Hashing Depth-Robust Graph
2016/2/23
A memory-hard function (MHF) f is equipped with a {\em space cost} σ and {\em time cost} τ parameter such that repeatedly computing fσ,τ on an application specific integrated circuit (ASIC) is not eco...
High Parallel Complexity Graphs and Memory-Hard Functions
Pebbling Graph Complexity Parallelism
2016/1/23
We develop new theoretical tools for proving lower-bounds on the (amortized) complexity of functions in a parallel setting. We demonstrate their use by constructing the first provably secure Memory-h...
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...
Fast and Tradeoff-Resilient Memory-Hard Functions for Cryptocurrencies and Password Hashing
memory-hard cryptocurrency bitcoin tradeoff
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...