On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
From MaRDI portal
Publication:3627439
DOI10.1007/978-3-642-01001-9_15zbMath1239.94041MaRDI QIDQ3627439
Fabien Laguillaumie, Guilhem Castagnos
Publication date: 12 May 2009
Published in: Advances in Cryptology - EUROCRYPT 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-01001-9_15
imaginary quadratic field-based cryptography; NICE cryptosystems; polynomial time total break; quadratic decryption
94A60: Cryptography
Related Items
Smallest Reduction Matrix of Binary Quadratic Forms, Modular polynomials via isogeny volcanoes, Multi-signatures for ECDSA and its applications in blockchain, I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups, Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\), Practical fully secure unrestricted inner product functional encryption modulo \(p\), Compact zero-knowledge proofs for threshold ECDSA with trustless setup, Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
Cites Work
- Factoring integers with elliptic curves
- A key-exchange system based on imaginary quadratic fields
- Towards practical non-interactive public-key cryptosystems using non-maximal imaginary qua\-dratic orders
- Efficient undeniable signature schemes based on ideal arithmetic in quadratic orders
- A new public-key cryptosystem over a quadratic order with quadratic decryption time.
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- An Adaptation of the NICE Cryptosystem to Real Quadratic Orders
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item