Title :
A Number Theoretic Memory Bounded Function and Its Applications
Author :
Cheng, Qi ; Li, Yu-Hsin
Author_Institution :
Sch. of Comput. Sci., Univ. of Oklahoma, Norman, OK
Abstract :
Memory bounded functions have been designed to combat email spams in a sequence of papers. The cost of computing the functions is usually dominated by random walks over large tables that cannot be put in CPU cache. In this paper, we propose a simple number theoretic way of generating such tables based on exponentiations of sparse polynomials modulo sparse irreducible polynomials over finite fields. We also present a formal definition of memory bounded functions that can be used to construct such tables.
Keywords :
number theory; polynomials; private key cryptography; random processes; unsolicited e-mail; email spam; exponentiation; finite field; hash function; number theoretic memory bounded function; random walk; secret key deriving; sparse irreducible polynomial modulo; Application software; Clocks; Complexity theory; Computer science; Computer security; Cost function; Cryptography; Galois fields; Polynomials; Hash function; key derivation function; sparse polynomial;
Conference_Titel :
Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for
Conference_Location :
Hunan
Print_ISBN :
978-0-7695-3398-8
Electronic_ISBN :
978-0-7695-3398-8
DOI :
10.1109/ICYCS.2008.114
