Security of cryptosystems based on class groups of imaginary quadratic orders

DOI10.1007/3-540-44448-3_18MaRDI QIDQ2707418zbMATH OpenFDO

Authors Safuat Hamdy, Bodo Möller

Publication date 18 December 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44448-3_18

zbMATH Keywords

class groupscryptosystemsdiscrete logarithm problemdiscriminant

Mathematics Subject Classification ID

Class numbers, class groups, discriminants (11R29) Cryptography (94A60)

Recommendations

• Reducing logarithms in totally non-maximal imaginary quadratic orders to logarithms in finite fields
• scientific article; zbMATH DE number 4171062
• Information Security and Privacy
• Towards practical non-interactive public-key cryptosystems using non-maximal imaginary qua\-dratic orders
• A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption

Cited in

(17)

• Cryptographic hash functions from expander graphs
• Towards practical non-interactive public-key cryptosystems using non-maximal imaginary qua\-dratic orders
• Quantum lattice enumeration and tweaking discrete pruning
• Towards practical key exchange from ordinary isogeny graphs
• KVaC: key-value commitments for blockchains and beyond
• A survey on IQ cryptography
• Linearly homomorphic encryption from \(\mathsf {DDH}\)
• Reducing logarithms in totally non-maximal imaginary quadratic orders to logarithms in finite fields
• scientific article; zbMATH DE number 2154276 (Why is no real title available?)
• Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом
• Information Security and Privacy
• Cryptography based on number fields with large regulator
• Inner product functional commitments with constant-size public parameters and openings
• A Trustless GQ Multi-signature Scheme with Identifiable Abort
• Efficient transparent polynomial commitments for zk-SNARKs
• Trustless unknown-order groups
• Multi-party revocation in sovrin: performance through distributed trust

This page was built for publication: Security of cryptosystems based on class groups of imaginary quadratic orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2707418)