Searching for "On the Computation of Discrete Logarithms in Class Groups." – sorted by Relevance.
-
On the computation of discrete logarithms in class groups (Extended Abstract)
- On the computation of discrete logarithms in class groups Extended abstract Johannes Buchmann
- Cited by 13 (2 self) – Add To MetaCart
-
Computing Discrete Logarithms In Quadratic Orders
- efficient algorithms for computing discrete logarithms in the class group of a quadratic order
- Cited by 6 (4 self) – Add To MetaCart
-
Asymptotically Fast Discrete Logarithms in Quadratic Number Fields
- . This article presents algorithms for computing discrete logarithms in class groups of quadratic number elds
- Cited by 10 (1 self) – Add To MetaCart
-
Towards Practical Non-interactive Public Key Cryptosystems Using Non-maximal Imaginary Quadratic Orders
- is cyclic with very high probability. In order to compute discrete logarithms in the class group, the KGC
- Cited by 5 (0 self) – Add To MetaCart
-
A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption
- with trapdoor decryption based on the difficulty of computing discrete logarithms in the class group of the non
- Cited by 15 (12 self) – Add To MetaCart
-
Security of cryptosystems based on class groups of imaginary quadratic orders
- discuss several strategies to compute discrete logarithms in those class groups. Based on heuristic
- Cited by 7 (1 self) – Add To MetaCart
-
A General Framework for Subexponential Discrete Logarithm Algorithms in Groups of Unknown Order
- subexponential discrete logarithm algorithm for class groups of unknown order. It solves both computational tasks
- Cited by 29 (5 self) – Add To MetaCart
-
A Survey on IQ Cryptography
- strategies to compute discrete logarithms in class groups have been investigated. These are: Reductions
- Cited by 2 (1 self) – Add To MetaCart
-
Rabin and RSA analogues based on nonmaximal imaginary quadratic orders
- .e. the class group of the maximal order. Since the computation of discrete logarithms in the class group
- Cited by 4 (4 self) – Add To MetaCart
-
Efficient implementation of cryptosystems based on non-maximal imaginary quadratic orders
- .e. the class group of the maximal order. Since the computation of discrete logarithms in the class group
- Cited by 6 (5 self) – Add To MetaCart

