The Multivariate Hidden Number Problem
From MaRDI portal
Publication:2947535
DOI10.1007/978-3-319-17470-9_15zbMath1359.94594WikidataQ61914010 ScholiaQ61914010MaRDI QIDQ2947535
Steven D. Galbraith, Barak Shani
Publication date: 24 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-17470-9_15
94A60: Cryptography
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hard-Core Predicates for a Diffie-Hellman Problem over Finite Fields
- Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves
- GLV/GLS Decomposition, Power Analysis, and Attacks on ECDSA Signatures with Single-Bit Nonce Bias
- 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
- The Security of All Bits Using List Decoding
- RSA and Rabin Functions: Certain Parts are as Hard as the Whole
- Public Key Cryptography – PKC 2004