Communication Complexity and Fourier Coefficients of the Diffie–Hellman Key-Reference-Cited by-同舟云学术

Communication Complexity and Fourier Coefficients of the Diffie–Hellman Key

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

Author:

Shparlinski Igor E.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/10719839_27

Reference31 articles.

1. Allender, E., Saks, M., Shparlinski, I.E.: A lower bound for primality. In: Proc. 14 IEEE Conf. on Comp. Compl., Atlanta, pp. 10–14. IEEE Press, Los Alamitos (1999)

2. Babai, L., Nisan, N., Szegedy, M.: Multiparty protocols, pseudorandom generators for logspace and time–space trade-offs. J. Comp. and Syst. Sci. 45, 204–232 (1992)

3. Bernasconi, A.: On the complexity of balanced Boolean functions. Inform. Proc. Letters 70, 157–163 (1999)

4. Lecture Notes in Computer Science;A. Bernasconi,1998

5. Bernasconi, A., Damm, C., Shparlinski, I. E.: Circuit and decision tree complexity of some number theoretic problems. Tech. Report 98-21 , Dept. of Math. and Comp. Sci., pp. 1–17. Univ. of Trier (1998)

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

1. An Explicit Bound On Double Exponential Sums Related to Diffie–Hellman Distributions;SIAM Journal on Discrete Mathematics;2008-01

2. Incomplete exponential sums and Diffie–Hellman triples;Mathematical Proceedings of the Cambridge Philosophical Society;2006-02-22

3. Threshold circuit lower bounds on cryptographic functions;Journal of Computer and System Sciences;2005-08

4. On the Representation of Boolean Predicates of the Diffie-Hellman Function;Lecture Notes in Computer Science;2003

5. Some doubly exponential sums over Zm;Acta Arithmetica;2002