Email this article 
Open Access
Subscription or Fee Access
Multi-Party Electronic Payment System using ECCMA Algorithm
Abstract
Security in digital communications nowadays depends on cryptography. Multiparty Key Access depends on algorithms for generating asymmetric keys. The present algorithmic rule in use is MKA that uses mathematical properties of prime numbers and therefore the quality of resolving giant numbers to come up with secure asymmetric keys. A more modern algorithmic rule that might be used is Elliptic Curve Cryptography (ECC). Elliptic Curves have mathematical properties in which specified uneven keys is generated which is stronger than those created by Existing strategies. To investigate the utilization of ECC for MKA, a basic ECC generator is used and it will generate live keys and coding durations. The comparative key strength of ECC and Existing strategies is taken into thought; ECC is orders of magnitude quicker than Existing strategies for a similar security. The problems preventing the adoption of ECC using MKA in Cryptography area for raising security unit mentioned. The properties rights of ECC are utilized in MKA, the biggest obstacle to ECC adoption are substitution the present MKA infrastructure that uses Existing strategies. It is expected that ECC in MKA can become customary by 2020.
Keywords
References
N. gura, a. patel a.wanter “comparing elliptic curve cryptography and RSA on 8-bit cpu, “proceedings of cryptographic hardware and embedded system “2004.
D. Hankerson and A. Menezes “software implementation of elliptic curve cryptographic over binary fields,” proceedings of workshop cryptography hardware embedded system “2000.
D.J. Malan, m.welsh “a public key infrastructure for key distribution in tinyOS based on elliptic curve cryptographic,” 2004.
Atmel Corporation, 8-bit microcontroller with 128K bytes in-system programmable flash: AT mega 128, 2004.
N. koblitz, elliptic curve cryptosystem,” mathematics of computation, vol. 48, pp. 203-209, 1987.
I. Blake, g. seroussi, and n. smart, elliptic curves in cryptography, Cambridge University press, 1999.
L.lopcz and r.dahab, “high speed software multiplication in F (2m),” proceedings of idocrypto ’00, pp. 203-212,2000.
V.miller, “uses of elliptic curves in cryptography,” advance in cryptology: proceedings of crypto ’85, pp. 471-426,1986.
National institute of standards and technology, digital signature standard, FIPS publication 186-2, Feb. 2000
J.solinas “efficient arithmetic on koblitz curves, “designs, codes and crypto graphy, vol. 19, pp.195-249, 2000.
N. koblitz, elliptic curve cryptosystem,” mathematics of computation, vol. 48, pp. 203-209, 1987.
I. Blake, g. seroussi, and n. smart, elliptic curves in cryptography, Cambridge University press, 1999.
L.lopcz and r.dahab, “high speed software multiplication in F(2m),” proceedings of idocrypto ’00, pp. 203-212, 2000.
V.miller, “uses of elliptic curves in cryptography,” advance in cryptology: proceedings of crypto ’85, pp. 471-426,1986.
National institute of standards and technology, digital signature standard, FIPS publication 186-2, Feb. 2000
J.solinas “Efficient arithmetic on koblitz curves, “designs, codes and crypto graphy, vol. 19, pp.195-249, 2000.
I. Blake, g. seroussi, and n. smart, elliptic curves in cryptography, Cambridge University press, 1999.
L.lopcz and r.dahab, “high speed software multiplication in F(2m),” proceedings of idocrypto ’00, pp. 203-212,2000.
V.miller, “uses of elliptic curves in cryptography,” advance in cryptology: proceedings of crypto ’85, pp. 471-426,1986.
National institute of standards and technology, digital signature standard, FIPS publication 186-2, Feb. 2000
J.solinas “efficient arithmetic on koblitz curves, “designs, codes and crypto graphy, vol. 19, pp.195-249, 2000.
N. gura, a. patel a.wanter “comparing elliptic curve cryptography and RSA on 8-bit cpu, “proceedings of cryptographic hardware and embedded system “2004.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.