Please use this identifier to cite or link to this item:
標題: Performance improvement for the GGM-construction of pseudorandom functions
作者: Chen, Y.S.
Horng, G.
Liu, C.L.
關鍵字: probabilistic polynomial-time (PPT) algorithm;pseudorandomness;pseudorandom function;pseudorandom bit generator;cryptography
Project: Applied Mathematics and Computation
期刊/報告no:: Applied Mathematics and Computation, Volume 183, Issue 1, Page(s) 486-490.
A pseudorandom function is a function that cannot be efficiently distinguished from a truly random function. The first construction of pseudorandom functions was introduced by Goldreich, Goldwasser, and Micali (GGM-construction). In this paper, we propose a variant of the GGM-construction and compare its performance with the original construction. We show that a 4-ary-tree variant construction can achieve the best performance under the assumption that the underlying pseudorandom generators generate pseudorandom bits sequentially. (c) 2006 Elsevier Inc. All rights reserved.
ISSN: 0096-3003
DOI: 10.1016/j.amc.2006.05.112
Appears in Collections:資訊科學與工程學系所

Show full item record

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.