Moderately hard, memory-bound functions
- 1 May 2005
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Internet Technology
- Vol. 5 (2) , 299-327
- https://doi.org/10.1145/1064340.1064341
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On Memory-Bound Functions for Fighting SpamPublished by Springer Nature ,2003
- Bankable Postage for Network ServicesPublished by Springer Nature ,2003
- Rigorous Time/Space Trade-offs for Inverting FunctionsSIAM Journal on Computing, 2000
- Spam!Communications of the ACM, 1998
- Curbing junk e-mail via secure classificationPublished by Springer Nature ,1998
- A simple scheme to make passwords based on one-way functions much harder to crackComputers & Security, 1996
- A cryptanalytic time-memory trade-offIEEE Transactions on Information Theory, 1980
- Secure communications over insecure channelsCommunications of the ACM, 1978