Improving smart card security using elliptic curve cryptography over prime field (F_p)

DOI10.1007/978-3-642-22288-7_11MaRDI QIDQ3100520zbMATHOpenAlexFDO

Authors Tursun Abdurahmonov, Eng-Thiam Yeoh, Helmi Mohamed Hussain

Publication date 24 November 2011

Published in Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22288-7_11

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites work

• scientific article; zbMATH DE number 1617931 (Why is no real title available?)
• scientific article; zbMATH DE number 3948147 (Why is no real title available?)
• scientific article; zbMATH DE number 1176835 (Why is no real title available?)
• scientific article; zbMATH DE number 2114384 (Why is no real title available?)
• scientific article; zbMATH DE number 2232692 (Why is no real title available?)
• A survey of recent developments in cryptographic algorithms for smart cards
• Efficient scalar multiplications for elliptic curve cryptosystems using mixed coordinates strategy and direct computations
• Elliptic Curve Cryptosystems
• Finding Collisions in the Full SHA-1
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Improving e-payment security using elliptic curve cryptosystem
• New directions in cryptography

Cited in

(3)

• scientific article; zbMATH DE number 2232692 (Why is no real title available?)
• A survey of recent developments in cryptographic algorithms for smart cards
• Communication-computation trade-off in executing ECDSA in a contactless smartcard

This page was built for publication: Improving smart card security using elliptic curve cryptography over prime field \((F_{p})\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100520)