Memory-hard function: Difference between revisions

Content deleted Content added
Citation bot (talk | contribs)
Alter: template type. Add: eprint, class, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Headbomb | #UCB_toolbar
m minor! sent.2-it is different_to_it differs, sent.3 MHFs are sometimes used in_to_use mhfs in items such as
Line 2:
{{Multiple issues|{{More citations needed|date=December 2019}}{{original research|date=December 2019}}{{tone|date=January 2021}}}}
 
In [[cryptography]], a '''memory-hard function''' (MHF) is a function that costs a significant amount of [[random-access memory|memory]] to evaluate. It is differentdiffers from a [[memory-bound function]], which incurs cost by slowing down computation through memory latency. Use MHFs arein sometimesitems usedsuch inas [[proof of work]].
 
== Memory hard measure ==