New Public-Key Cryptosystem Using Divisor Class Groups

Authors:
Hwankoo Kim;SangJae Moon
Affiliations:
-;-
Venue:
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
Year:
2001

Citing 8
Cited 0

Discrete logarithms in finite fields and their cryptographic significance

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
A key-exchange system based on imaginary quadratic fields

Journal of Cryptology
Hyperelliptic cryptosystems

Journal of Cryptology
Computational methods in commutative algebra and algebraic geometry

Computational methods in commutative algebra and algebraic geometry
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
On the Complexity of the Groebner-Bases Algorithm over K[x, y, z]

EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
On the Computation of Discrete Logarithms in Class Groups

CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)

Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show how to use ideal arithmetic in the divisor class group of an affine normal subring of K[X, Y] generated by monomials, where K is a field, to design new public-key cryptosystems, whose security is based on the difficulty of the discrete logarithm problem in the divisor class group of that integral domain.