Efficient Pseudorandom Generators Based on the DDH Assumption-Reference-Cited by-同舟云学术

Efficient Pseudorandom Generators Based on the DDH Assumption

Published:2007 Issue: Volume: Page:426-441
ISSN:0302-9743
Container-title:Public Key Cryptography – PKC 2007
language:
Short-container-title:

Author:

Farashahi Reza Rezaeian,Schoenmakers Berry,Sidorenko Andrey

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-71677-8_28

Reference31 articles.

1. Barker, E., Kelsey, J.: Recommendation for random number generation using deterministic random bit generators. NIST Special Publication (SP) 800-90 (December 2005)

2. Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing 13(4), 850–864 (1984)

3. Brown, D.: Conjectured security of the ANSI-NIST Elliptic Curve RNG. Cryptology ePrint Archive, Report 2006 /117 (2006), http://eprint.iacr.org/

4. Lecture Notes in Computer Science;O. Chevassut,2006

5. Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM Journal on Computing, 167–226 (2003)

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

1. An Innovative Feasible Approach for Multi-Media Security Using Both Chaotic and Elliptic Curve Structures;IEEE Access;2024

2. An efficient and secure recommendation system based on federated matrix factorization in digital economy;Personal and Ubiquitous Computing;2022-01-30

3. Privacy-Preserving Authenticated Key Exchange in the Standard Model;Advances in Cryptology – ASIACRYPT 2022;2022

4. Pseudorandom number generator based on supersingular elliptic curve isogenies;Science China Information Sciences;2021-05-26

5. On the Quantum versus Classical Learnability of Discrete Distributions;Quantum;2021-03-23