A Public-Key Cryptosystem Scheme on Conic Curves over the Ring Zn
نویسندگان
چکیده
A public key cryptosystem scheme is proposed that are based on conic curves over the ring Zn. Our scheme is motivated by KMOV scheme on elliptic curves, but our scheme remove some restrictive condition from KMOV scheme and constructed on conic curves. Its security bases on the difficulty of factoring a composite number n, just like RSA. It can resist some of the known attacks on RSA. We also constructed digital signature and a proxy signature on our scheme. Since encoding and decoding over conic are easily implement, it has enabled our scheme to greatly enhance efficiency. Also, our schemes can be used in the mobile payment system with the limited bandwidth. Key-Words: residue class ring Zn, conic curve, public-key cryptosystem, digital signature, proxy signature
منابع مشابه
A Distributed E-Business System Based on Conic Curve
A distributed E-Business System based on conic curve is proposed. This scheme is composed of two parts, constructing license and validating license. Because the security of license is determined by private key, not the arithmetic itself, user can not construct new license by given license and the public key as long as the private key is not leaked. Since encoding and decoding over conic are eas...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملA Public Key Cryptosystem Based on Elliptic Curves over Z/nZ Equivalent to Factoring
Elliptic curves over the ring Z / n Z where R is the product of two large primes have first been proposed for public key cryptosystems in [4]. The security of this system is based on the integer factorization problem, but it is unknown whether breaking the system is equivalent to factoring. In this paper, we present a variant of this cryptosystem for which breaking the system is equivalent to f...
متن کاملA Public Key Cryptosystem Based on EllipticCurves over ZZ = nZZ Equivalent to
Elliptic curves over the ring Z Z=nZ Z where n is the product of two large primes have rst been proposed for public key cryptosystems in 4]. The security of this system is based on the integer factorization problem, but it is unknown whether breaking the system is equivalent to factoring. In this paper, we present a variant of this cryptosystem for which breaking the system is equivalent to fac...
متن کاملA Note on the Complexity of Breaking Okamoto-Tanaka ID-Based Key Exchange Scheme
The rigorous security of Okamoto-Tanaka identity-based key exchange scheme has been open for a decade. In this paper, we show that (1) breaking the scheme is equivalent to breaking the Diffie-Hellman key exchange scheme over Zn, and (2) impersonation is easier than breaking. The second result is obtained by proving that breaking the RSA public-key cryptosystem reduces to breaking the Diffie-Hel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006