Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}

Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$

Published:2008 Issue: Volume: Page:181-202
ISSN:0302-9743
Container-title:Post-Quantum Cryptography
language:
Short-container-title:

Author:

Liu Feng-Hao,Lu Chi-Jen,Yang Bo-Yin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-88403-3_13

Reference33 articles.

1. Lecture Notes in Computer Science;J.-P. Aumasson,2007

2. Bard, G.V., Courtois, N.T., Jefferson, C.: Efficient methods for conversion and solution of sparse systems of low-degree multivariate polynomials over gf(2) via sat-solvers. Cryptology ePrint Archive, Report 2007/024 (2007), http://eprint.iacr.org/

3. Bardet, M., Faugère, J.-C., Salvy, B.: On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations. In: Proceedings of the International Conference on Polynomial System Solving, pp. 71–74 (2004) (Previously INRIA report RR-5049)

4. Bardet, M., Faugère, J.-C., Salvy, B., Yang, B.-Y.: Asymptotic expansion of the degree of regularity for semi-regular systems of equations. In: Gianni, P. (ed.) MEGA 2005 Sardinia (Italy) (2005)

5. Lecture Notes in Computer Science;C. Berbain,2007

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

1. Non-interactive Zero-Knowledge from LPN and MQ;Lecture Notes in Computer Science;2024

2. Revisiting the Security Proof of QUAD Stream Cipher: Some Corrections and Tighter Bounds;Information Security and Cryptology;2017

3. Efficient Parallel Evaluation of Multivariate Quadratic Polynomials on GPUs;Information Security Applications;2012

4. Public-Key Cryptography from New Multivariate Quadratic Assumptions;Public Key Cryptography – PKC 2012;2012