Improving e-payment security using elliptic curve cryptosystem

DOI10.1007/S10660-010-9047-ZzbMath1211.68189OpenAlexW1982957012MaRDI QIDQ968357

A. D. Akinde, O. Folorunso, O. R. Vincent

Publication date: 5 May 2010

Published in: Electronic Commerce Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10660-010-9047-z

zbMATH Keywords

securitye-commerceelliptic curve cryptographye-paymentprime finite field \(GF(p)\)

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (1)

Improving Smart Card Security Using Elliptic Curve Cryptography over Prime Field (F p )

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New schemes for sharing points on an elliptic curve
• An area/performance trade-off analysis of a GF\((2^m)\) multiplier architecture for elliptic curve cryptography
• Some ways to secure elliptic curve cryptosystems
• The discrete logarithm problem on elliptic curves of trace one
• Elliptic Curve Cryptosystems
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Reducing elliptic curve logarithms to logarithms in a finite field
• Complexity and Cryptography

This page was built for publication: Improving e-payment security using elliptic curve cryptosystem