Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions
Authors:
Open Access
- 30 October 2017
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1001-1017
Abstract
No abstract availableKeywords
Funding Information
- European Research Council, ERC consolidator grant (682815 - TOCNeT)
This publication has 2 references indexed in Scilit:
- Moderately hard, memory-bound functionsACM Transactions on Internet Technology, 2005
- Graph-theoretic arguments in low-level complexity1977