Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator

DOI10.1007/s10623-017-0435-4zbMath1411.94092MaRDI QIDQ1650812

Lei Hu, Zhangjie Huang, Santanu Sarkar, Jun Xu, Liqiang Peng

Publication date: 13 July 2018

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-017-0435-4

zbMATH Keywords

lattice; LLL algorithm; Coppersmith's technique; inversive congruential generator; modular inversion hidden number problem

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

11Y16: Number-theoretic algorithms; complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the modular inversion hidden number problem
• Factoring polynomials with rational coefficients
• On the correlation of pseudorandom numbers generated by inversive methods
• On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders
• On the structure of digital explicit nonlinear and inversive pseudorandom number generators
• Inferring Sequences Produced by Nonlinear Pseudorandom Number Generators Using Coppersmith’s Methods
• Solving Hidden Number Problem with One Bit Oracle and Advice
• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
• Recent Results on Recursive Nonlinear Pseudorandom Number Generators
• Inferring sequences produced by pseudo-random number generators
• Predicting nonlinear pseudorandom number generators
• On the Structure of Inversive Pseudorandom Number Generators
• Cryptography and Coding
• Lattice attacks on digital signature schemes