Hardware architectures for public key cryptography

Batina, Lejla; Örs, Berna; Preneel, Bart; Vandewalle, Joos

doi:10.1016/s0167-9260(02)00053-6

Cited by 80 publications

(53 citation statements)

References 182 publications

(219 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…-The 56-bit DES keys are transmitted encrypted using an asymmetric public-key scheme, in our case Elliptic Curve Cryptography. In the field of public-key cryptography, Elliptic Curves (ECs) have performance and keysize advantages over the RSA scheme [16]. We therefore choose them for our design.…”

Section: Developing Cryptography On Poly-si Tftsmentioning

confidence: 99%

Implementing Cryptography on TFT Technology for Secure Display Applications

Oikonomakos

Fournier

Moore

2006

Smart Card Research and Advanced Applications

View full text Add to dashboard Cite

Abstract. Several recent studies have underlined the need for trusted information displays in current and future personal devices. On the other hand, the display market is more and more dominated by low-cost flatpanel structures, driven by Thin-Film Transistor (TFT) circuits. Further, the quality of TFT-based electronics is constantly improving, allowing the fabrication of complicated electronic circuits on TFT technology. We have embarked on a project to implement cryptographic algorithms on polysilicon TFT technology. Our prototype designs will pave the way for secure display realisations combining cryptographic circuits and conventional pixel drivers on the same substrate. An experimental Data Encryption Standard (DES) coprocessor on polysilicon TFT technology is under development, while we are investigating a vector processor architecture to implement Elliptic Curve Cryptography (ECC).

show abstract

Section: Developing Cryptography On Poly-si Tftsmentioning

confidence: 99%

Implementing Cryptography on TFT Technology for Secure Display Applications

Oikonomakos

Fournier

Moore

2006

Smart Card Research and Advanced Applications

View full text Add to dashboard Cite

show abstract

“…The multiplier they use is a digit-serial shift-and-add multiplier. For a detailed survey of finite field multipliers and processors for PKC see [25].…”

Section: Previous Work On Hardware Implementations Of Eccmentioning

confidence: 99%

Balanced point operations for side-channel protection of elliptic curve cryptography

Batina

Mentens

Preneel

et al. 2005

IEE Proc. Inf. Secur.

View full text Add to dashboard Cite

The authors propose balanced algorithms for elliptic curve cryptography (ECC). The authors make the point addition and doubling balanced; that is, they are implemented as identical sequences of operations. As an example the authors implement an ECC point multiplication algorithm, using the approach of Montgomery, for which a single power trace does not expose the Hamming weight nor the bits of the secret key. Nevertheless, their fieldprogrammable gate array implementation is also compact and efficient. The proposed multiplier for the finite field operations is digit serial and scalable to arbitrary bit-lengths. The method calculates the result by splitting the multiplication into two separate processes. The architecture presented compares favourably with designs presented in the literature. Furthermore, the power consumption graphs show the new implementation has an improved side-channel resistance.

show abstract

“…All three operations, doubling, addition, and subtraction are used in the point multiplication algorithm. Figure 1 shows the point multiplication algorithm [8] that is based on the signed digit representation of integer k and is considered to be a faster point multiplication algorithm compared to the algorithm based on the regular binary representation [9]. This algorithm uses the elliptic curve group operations (double, addition, and subtract) based on the underlying Galois Field.…”

Section: Elliptic Curve Cryptosystemmentioning

confidence: 99%