Non-linear Complexity of the Naor–Reingold Pseudo-random Function-Reference-Cited by-同舟云学术

Non-linear Complexity of the Naor–Reingold Pseudo-random Function

Published:2000 Issue: Volume: Page:53-59
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Banks William D.,Griffin Frances,Lieman Daniel,Shparlinski Igor E.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/10719994_5

Reference9 articles.

1. Cusick, T.W., Ding, C., Renvall, A.: Stream Ciphers and Number Theory. Elsevier, Amsterdam (1998)

2. Lecture Notes in Computer Science;F. Griffin,1999

3. Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Cryptography. CRC Press, Boca Raton (1996)

4. Naor, M., Reingold, O.: Number-theoretic constructions of effcient pseudo- random functions. In: Proc. 38th IEEE Symp. on Foundations of Comp. Sci (FOCS 1997), Miami Beach, pp. 458–467. IEEE, Los Alamitos (1997)

5. Niederreiter, H.: Some computable complexity measures for binary sequences. In: Ding, C., Helleseth, T., Niederreiter, H. (eds.) Proc. Intern. Conf. on Sequences and their Applications (SETA 1998), Singapore, pp. 67–78. Springer, London (1999)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Polynomial interpolation of the generalized Diffie–Hellman and Naor–Reingold functions;Designs, Codes and Cryptography;2018-05-02

2. Polynomial interpolation of the Naor–Reingold pseudo-random function;Applicable Algebra in Engineering, Communication and Computing;2016-11-16

3. Distribution and Polynomial Interpolation of the Dodis-Yampolskiy Pseudo-Random Function;Arithmetic of Finite Fields;2016

4. On the Distribution of the Diffie–Hellman Pairs;Finite Fields and Their Applications;2002-04