A Hardware Processor Supporting Elliptic Curve Cryptography for Less than 9 kGEs

Wenger, Erich; Hutter, Michael

doi:10.1007/978-3-642-27257-8_12

Cited by 15 publications

(15 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…B) for area and cycles of ECC coprocessors that follow the design decisions presented in this paper and perform point multiplications on curves B-163 or K-163. Our estimates show that our coprocessors for both B-163 and K-163 require more cycles in comparison to [43] which also uses a 16-bit ALU. The reason behind this is that [43] uses a dual-port RAM, whereas our implementation uses a single-port RAM (as it works as a coprocessor of MSP430).…”

Section: Results and Comparisonsmentioning

confidence: 94%

Lightweight Coprocessor for Koblitz Curves: 283-Bit ECC Including Scalar Conversion with only 4300 Gates

Roy

Järvinen

Verbauwhede

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We propose a lightweight coprocessor for 16-bit microcontrollers that implements high security elliptic curve cryptography. It uses a 283-bit Koblitz curve and offers 140-bit security. Koblitz curves offer fast point multiplications if the scalars are given as specific τ-adic expansions, which results in a need for conversions between integers and τ-adic expansions. We propose the first lightweight variant of the conversion algorithm and, by using it, introduce the first lightweight implementation of Koblitz curves that includes the scalar conversion. We also include countermeasures against side-channel attacks making the coprocessor the first lightweight coprocessor for Koblitz curves that includes a set of countermeasures against timing attacks, SPA, DPA and safe-error fault attacks. When the coprocessor is synthesized for 130 nm CMOS, it has an area of only 4,323 GE. When clocked at 16 MHz, it computes one 283-bit point multiplication in 98 ms with a power consumption of 97.70 µW, thus, consuming 9.56 µJ of energy.

show abstract

Section: Results and Comparisonsmentioning

confidence: 94%

Lightweight Coprocessor for Koblitz Curves: 283-Bit ECC Including Scalar Conversion with only 4300 Gates

Roy

Järvinen

Verbauwhede

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…As a controller, we decided to use our own 16-bit microcontroller called Neptun [33,34,35] that is especially optimized for elliptic-curve cryptography. The processor comes with twelve special-purpose registers and uses a Harvard architecture with separated program and data memory.…”

Section: Comparison Resultsmentioning

confidence: 99%

“…For instance, in [34,33] and [35], Ould-Slimane et al give an automata based inlining procedure which relies on a new operator that embeds a property automata into a target program. For instance, in [34,33] and [35], Ould-Slimane et al give an automata based inlining procedure which relies on a new operator that embeds a property automata into a target program.…”

Section: Related Workmentioning

confidence: 99%

“…In this paper, we answer these questions by presenting two distinct custom 16-bit processors that leverage binary-field operations and prime-field operations and are based on [35] and [34]. Using a metric consisting of area, speed, power, and energy, we not only compare both designs in terms of finite-field operation and ECC point-multiplication performance, we also investigate a higher-level protocol.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Information Security Technology for Applications

Laud¹

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

PrefaceThese are the conference proceedings of NordSec 2011, the 16th Nordic Conference on Secure IT-Systems. They contain the revised versions of the full papers that were accepted and presented at the conference, which took place during October 26-28, 2011, in Tallinn, Estonia. The NordSec workshops were started in 1996 with the aim of bringing together researchers and practitioners within computer security in the Nordic countries, thereby establishing a forum for discussions and co-operation between universities, industry and computer societies. Since then, the workshop has developed into a fully fledged international information security conference, held in the Nordic countries on a round robin basis.This year, the conference accepted contributions in the form of full papers, short papers, and posters. Full papers were solicited for mature results, short papers for ongoing work, and posters as a form of student contribution. We received a total of 51 valid paper submissions, among them 8 submissions as short papers. The Program Committee tried to give at least three reviews to all submissions. Out of the submitted papers, 16 were accepted as full papers and 8 as short papers. Also, some full submissions were accepted as short papers. In addition to the talks by the authors of accepted papers, we also had two invited talks by Estonian e-governance and security specialists. In their talks, they analyzed some of the most-used and highest-profile information systems for the Estonian e-government -the X-road middleware and the Internet voting system.Since 2008, Nordsec conferences have been happy to welcome the participation of the Second-year students of the international Erasmus Mundus master's programme "NordSecMob" in security and mobile computing. The students are encouraged to participate in the conference by submitting posters reporting on work they have performed. This year, six posters were submitted and presented at the conference.Even though NordSec is not a large conference, the efforts of many people are necessary for its successful organization. We would like to thank everybody who made the conference possible. We thank the Program Committee for reviewing the papers and discussing them, thereby creating the best possible program for the conference. We thank the subreviewers for the extra help they gave us with the reviews. We also thank the Poster Chair for helping the students to produce high-quality posters for the conference, and the invited speakers for agreeing to share their insights. And obviously, we are thankful to all the authors for submitting their papers for consideration of the program committee because, without those, there would not have been anything in the conference program. VI PrefaceWe are especially grateful to the Organizing Committee of the conference. Making sure that all the tiny details are taken care of is a lot of work, and we heartfully thank Imbi, Liina, and Madeline for that.

show abstract

“…However, Lee et al [22,23] and Wenger and Hutter [33] showed that public-key cryptography can be implemented. More specifically, these papers proposed efficient dedicated coprocessors that can do elliptic curve arithmetic on curves suitable for Elliptic Curve Cryptography (ECC).…”

Section: Introductionmentioning

confidence: 98%

Efficient, secure, private distance bounding without key updates

Hermans

Peeters

Onete

2013

Proceedings of the Sixth ACM Conference on Security and Privacy in Wireless and Mobile Networks

View full text Add to dashboard Cite

We propose a new distance bounding protocol, which builds upon the private RFID authentication protocol by Peeters and Hermans [25]. In contrast to most distance-bounding protocols in literature, our construction is based on publickey cryptography. Public-key cryptography (specifically Elliptic Curve Cryptography) can, contrary to popular belief, be realized on resource constrained devices such as RFID tags. Our protocol is wide-forward-insider private, achieves distance-fraud resistance and near-optimal mafia-fraud resistance. Furthermore, it provides strong impersonation security even when the number of time-critical rounds supported by the tag is very small. The computational effort for the protocol is only four scalar-EC point multiplications. Hence the required circuit area is minimal because only an ECC coprocessor is needed: no additional cryptographic primitives need to be implemented.

show abstract

A Hardware Processor Supporting Elliptic Curve Cryptography for Less than 9 kGEs

Cited by 15 publications

References 26 publications

Lightweight Coprocessor for Koblitz Curves: 283-Bit ECC Including Scalar Conversion with only 4300 Gates

Lightweight Coprocessor for Koblitz Curves: 283-Bit ECC Including Scalar Conversion with only 4300 Gates

Information Security Technology for Applications

Efficient, secure, private distance bounding without key updates

Contact Info

Product

Resources

About