Results 81 to 90 of about 291 (124)
Some of the next articles are maybe not open access.
One-More Unforgeability of Blind ECDSA
Lecture Notes in Computer Science, 2021In this paper, we give the first formal security analysis on the one-more unforgeability of blind ECDSA. We start with giving a general attack on blind ECDSA, which is similar to the ROS attack on the blind Schnorr signature. We formulate the ECDSA-ROS problem to capture this attack.
Tsz Hon Yuen, Xianrui Qin
exaly +4 more sources
Secure Two-Party Threshold ECDSA From ECDSA Assumptions
2018 IEEE Symposium on Security and Privacy (SP), 2018The Elliptic Curve Digital Signature Algorithm (ECDSA) is one of the most widely used schemes in deployed cryptography. Through its applications in code and binary authentication, web security, and cryptocurrency, it is likely one of the few cryptographic algorithms encountered on a daily basis by the average person.
Jack Doerner +2 more
exaly +3 more sources
2009 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), 2009
An advantage of schemes based on elliptic curve cryptography (ECC) is that they require a smaller key size than other public key schemes to guarantee the same level of security. Thus, ECC algorithms are well suited for systems with constrained resources like smart cards or mobile devices.
Jörn-Marc Schmidt, Marcel Medwed
openaire +2 more sources
An advantage of schemes based on elliptic curve cryptography (ECC) is that they require a smaller key size than other public key schemes to guarantee the same level of security. Thus, ECC algorithms are well suited for systems with constrained resources like smart cards or mobile devices.
Jörn-Marc Schmidt, Marcel Medwed
openaire +2 more sources
2009
Template attacks have been considered exclusively in the context of implementations of symmetric cryptographic algorithms on 8-bit devices. Within these scenarios, they have proven to be the most powerful attacks. In this article we investigate how template attacks can be applied to implementations of an asymmetric cryptographic algorithm on a 32-bit ...
Marcel Medwed, Elisabeth Oswald
openaire +3 more sources
Template attacks have been considered exclusively in the context of implementations of symmetric cryptographic algorithms on 8-bit devices. Within these scenarios, they have proven to be the most powerful attacks. In this article we investigate how template attacks can be applied to implementations of an asymmetric cryptographic algorithm on a 32-bit ...
Marcel Medwed, Elisabeth Oswald
openaire +3 more sources
Attacking ECDSA-Enabled RFID Devices
Lecture Notes in Computer Science, 2009The elliptic curve digital signature algorithm (ECDSA) is used in many devices to provide authentication. In the last few years, more and more ECDSA implementations have been proposed that allow the integration into resource-constrained devices like RFID tags. Their resistance against power-analysis attacks has not been scrutinized so far.
Michael Hutter, Daniel Hein
exaly +2 more sources
Proceedings of the International Conference and Workshop on Emerging Trends in Technology, 2010
This paper describes a new variant level of signature scheme on ECDSA. In support of this scheme, a study of on a number of schemes was done. The number of scheme includes Lamport, Fail stop, Schnorr, and DSA etc. In this study three schemes, DSA, ECDSA and variant ECDSA are taken for a comparative study.
M. Prabu, R. Shanmugalakshmi
openaire +1 more source
This paper describes a new variant level of signature scheme on ECDSA. In support of this scheme, a study of on a number of schemes was done. The number of scheme includes Lamport, Fail stop, Schnorr, and DSA etc. In this study three schemes, DSA, ECDSA and variant ECDSA are taken for a comparative study.
M. Prabu, R. Shanmugalakshmi
openaire +1 more source
Exploration of Design Space in ECDSA
2002The paper compares FPGA implementation of scaled polynomial basis and normal basis arithmetic units in the context of cryptographic coprocessor performing operations on elliptic curve points with coordinates in GF(2m). The hardware uses GCD division in polynomial basis and Itoh-Teechai-Tsujii inversion in normal basis.
Jan Schmidt +4 more
openaire +1 more source
Design of Proxy Signature in ECDSA
2008 Eighth International Conference on Intelligent Systems Design and Applications, 2008DSA and ECDSA are two standard signatures, which have been fully discussed and well accepted. However, they both lack functionality of proxy signature. On the other hand, most of the proxy signature schemes, which have been proposed prior to this date, are seldom based on standard signatures.
Ming-Hsin Chang, I-Te Chen, Ming-Te Chen
openaire +1 more source
An ECDSA Processor for RFID Authentication
2010In the last few years, a lot of research has been made to bring asymmetric cryptography on low-cost RFID tags. Many of the proposed implementations include elliptic-curve based coprocessors to provide entity-authentication services through for example identification schemes.
Michael Hutter +2 more
openaire +2 more sources