Efficient implementation of cryptosystems based on non-maximal imaginary quadratic orders
From MaRDI portal
Recommendations
Cited in
(14)- Towards practical non-interactive public-key cryptosystems using non-maximal imaginary qua\-dratic orders
- Improved efficiency of a linearly homomorphic cryptosystem
- scientific article; zbMATH DE number 1617913 (Why is no real title available?)
- A NICE cryptanalysis
- An Adaptation of the NICE Cryptosystem to Real Quadratic Orders
- On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
- Factoring \(pq ^{2}\) with quadratic forms: Nice cryptanalyses
- A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption
- scientific article; zbMATH DE number 1504821 (Why is no real title available?)
- scientific article; zbMATH DE number 1759644 (Why is no real title available?)
- An efficient NICE-Schnorr-type signature scheme
- Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом
- I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups
- New designing of cryptosystems based on quadratic fields
This page was built for publication: Efficient implementation of cryptosystems based on non-maximal imaginary quadratic orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4949333)