Prime Field ECDSA Signature Processing for Reconfigurable Embedded Systems

Glas, Benjamin; Sander, Oliver; Stuckert, Vitali; Müller-Glaser, Klaus D.; Becker, J.

doi:10.1155/2011/836460

Cited by 29 publications

(16 citation statements)

References 23 publications

(22 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In summary, our implementation of Bliss is superior to [16] in almost all aspects. In addition to that Glas et al [15] report a vehicle-to-X communication accelerator based on an ECDSA signature over 256-bit prime fields. With respect to this, our Bliss implementation shows higher performance at less resource cost.…”

Section: Bliss Operationsmentioning

confidence: 99%

Enhanced Lattice-Based Signatures on Reconfigurable Hardware

Pöppelmann

Ducas

Güneysu

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The recent Bimodal Lattice Signature Scheme (Bliss) showed that lattice-based constructions have evolved to practical alternatives to RSA or ECC. Besides reasonably small signatures with 5600 bits for a 128-bit level of security, Bliss enables extremely fast signing and signature verification in software. However, due to the complex sampling of Gaussian noise with high precision, it is not clear whether this scheme can be mapped efficiently to embedded devices. Even though the authors of Bliss also proposed a new sampling algorithm using Bernoulli variables this approach is more complex than previous methods using large precomputed tables. The clear disadvantage of using large tables for high performance is that they cannot be used on constrained computing environments, such as FPGAs, with limited memory. In this work we thus present techniques for an efficient Cumulative Distribution Table (CDT) based Gaussian sampler on reconfigurable hardware involving Peikert's convolution lemma and the Kullback-Leibler divergence. Based on our enhanced sampler design, we provide a first Bliss architecture for Xilinx Spartan-6 FPGAs that integrates fast FFT/NTT-based polynomial multiplication, sparse multiplication, and a Keccak hash function. Additionally, we compare the CDT with the Bernoulli approach and show that for the particular Bliss-I parameter set the improved CDT approach is faster with lower area consumption. Our core uses 2,431 slices, 7.5 BRAMs, and 6 DSPs and performs a signing operation in 126 µs on average. Verification takes even less with 70 µs.

show abstract

Section: Bliss Operationsmentioning

confidence: 99%

Enhanced Lattice-Based Signatures on Reconfigurable Hardware

Pöppelmann

Ducas

Güneysu

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The achieved times for signature generation and verification were respectively 0.94ms and 1.61ms. Another solution proposed in [27] designed to operate over prime fields with a key length of 256-bit, for a FPGA Xilinx Virtex 5 using 14256 LUT/FF achieved a 7.15ms generation time and a 9.09ms verification time. Implementations like these are still too slow for the worst case scenario, verifying only a few messages per second.…”

Section: Hardware Implementation Approachmentioning

confidence: 99%

Implementation of Security Services for Vehicular Communications

Duarte

Silva

Fernandes

et al. 2017

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

agradecimentos / acknowledgementsÉcom muito gosto que agradeço aos meus orientadores, Arnaldo Oliveira e Joaquim Ferreira, pela proposta de dissertação e ajuda ao longo deste trabalho. Um especial agradecimentoà minha família em particular aos meus pais e ao meu irmão por todo o apoio e motivação ao longo da minha formação académica. Agradeço tambémà Ana por me apoiar nos meus piores momentos e por me ter dado força durante esta caminhada.Quero também agradecer a todos os meus amigos que me proporcionaram bons momentos ao longo do meu percurso académico.Às pessoas do laboratório de Radio Frequência pelo bom ambiente proporcionado ao longo do meu trabalho. Palavras-chave AbstractOver the last few years there has been a considerable development in the field of vehicular communications (VC) in order to develop standards and prototypes that satisfy the requirements of the Intelligent Transportation System (ITS). One of these standards is the IEEE 802.11p that defines the physical layers to create a platform for vehicular communications. Cars and elements on the road are viewed as wireless routers (nodes), creating a VANET (Vehicular Ad-Hoc Network), which is part of the ITS. It's intention is to provide several services as: a safer environment for drivers by reducing the number of accidents/injuries; improve traffic congestion and consequently reduce the impact of cars in the environment; provide infotainment services. These networks have promising features to guarantee a high level of safety between drivers, however they have to work on a secure and anonymous way since they can be threatened and attacked by malicious sources. Therefore more recently studies have focused on studying the impact of security on VC.In this dissertation it is proposed the creation of an architecture and the analysis of the impact of security services when they are added to VANET. This is achieved by using the IEEE 1609.2 Standard to overcome the limitations of security on vehicular communications. An implementation of the required cryptographic algorithms and protocols to manage the sharing of secure messages according to the IEEE 1609.2 Standard was developed with the help of the OpenSSL library. The ECDSA cryptographic algorithm ensures the authentication of all messages, which is the focus of this dissertation. In order to achieve an architecture capable of being integrated and tested in a real scenario, the implemented system was joined with other applications as the WSMP (WAVE Short Message Protocol) and the generation of CAM messages. With this integration it was possible to evaluate the overhead that is caused when the process to sign/verify a digital message is added to a vehicular communication. For these tests a Raspberry-Pi was used as a On Board Unit, concluding that a pure software implementation is not feasible, allowing only a maximum number of 40 signature verifications/second using the ECDSA cryptographic algorithm.

show abstract

“…The implementation results indicates signature generation in 7.15ms is expectedly the slowest operation requires a point multiplication and generation of a _______________________________________________________________________________________ random integer. Verification in 9.09ms which requires computation of two point multiplications is expectedly the fastest operation [8] L.Batina proposed the identification of RFID-tags will reach high security levels and identification protocols like RFID-tags based on the DL problem on elliptic curves are implemented on a constrained device which requires 8500 and 1400 gates. Case of both elliptic curved over F 2 P C and over composite fields F 2 2 P are investigated.…”

Section: Related Work and Contributionsmentioning

confidence: 99%

Elliptical Curve Digital Signatures Algorithm

Prajna¹

2015

IJRITCC

View full text Add to dashboard Cite

Abstract-Elliptical digital signatures algorithm provides security services for resource constrained embedded devices. The ECDSA level security can be enhanced by several parameters as parameter key size and the security level of ECDSA elementary modules such as hash function, elliptic curve point multiplication on koblitz curve which is used to compute public key and a pseudo-random generator which generates key pair generation. This paper describes novel security approach on authentication schemes as a modification of ECDSA scheme.This paper provides a comprehensive survey of recent developments on elliptic curve digital signatures approaches. The survey of ECDSA involves major issues like security of cryptosystem, RFID-tag authentication, Montgomery multiplication over binary fields, Scaling techniques, Signature generation ,signature verification, point addition and point doubling of the different coordinate system and classification.Index terms-Random generator, secure hash algorithm, Elliptic Curve digital signature algorithm. Koblitz curves, FPGA and cryptography.

show abstract

Prime Field ECDSA Signature Processing for Reconfigurable Embedded Systems

Cited by 29 publications

References 23 publications

Enhanced Lattice-Based Signatures on Reconfigurable Hardware

Enhanced Lattice-Based Signatures on Reconfigurable Hardware

Implementation of Security Services for Vehicular Communications

Elliptical Curve Digital Signatures Algorithm

Contact Info

Product

Resources

About