Low-Power Elliptic Curve Cryptography Using Scaled Modular Arithmetic

Öztürk, Erdinç; Sunar, Berk; Savaş, Erkay

doi:10.1007/978-3-540-28632-5_7

Cited by 46 publications

(21 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[9] is designed for high frequency applications and cannot be used in smart IC cards. [12] has less gates, but it is still two times of ours and isn't as good as ours in other aspects. Fig.…”

Section: Hardware Modules Implementation and Synthesismentioning

confidence: 66%

A high-performance elliptic curve cryptographic coprocessor with side channel analysis countermeasures for smart IC card

Han

Wang

et al. 2015

IEICE Electron. Express

View full text Add to dashboard Cite

This paper presents a design of an elliptic curve coprocessor over GF( p) with side-channel analysis countermeasures and fast implementation schemes, which can be used for all elliptic curve cryptographic algorithms, such as ECC and SM2. The proposed coprocessor can resist side channel analysis and is implemented basing on the C*Core-C0 platform. Using SMIC 0.13-µm CMOS technology, synthesis results show that our coprocessor can perform one 256-bit elliptic curve scalar multiplication over the prime field in 8.35 ms at 50 MHz with only 1.98 mW and 17.7K gates. The proposed coprocessor outperforms other coprocessors in terms of the overall performance of area, power, speed and security, which is quite suitable for smart IC card.

show abstract

Section: Hardware Modules Implementation and Synthesismentioning

confidence: 66%

A high-performance elliptic curve cryptographic coprocessor with side channel analysis countermeasures for smart IC card

Han

Wang

et al. 2015

IEICE Electron. Express

View full text Add to dashboard Cite

show abstract

“…A Pseudorandom Number Generators (PRNG) are well-known techniques with broad applications in such areas as cryptography (Tusnoo et al, 2003;Ozturk et al, 2004;Panneton et al, 2006), simulation of stochastic processes (Entacher, 1998), comprehensive testing of technical systems (Leeb and Wegenkittl, 1997;Park and Miller, 1998), medical (Menyaev and Zharov, 2006a;2006b;Menyaev and Zharova, 2006;2013;2016;Sarimollaoglu et al, 2014;Cai et al, 2016a;2016b) and biological research (Wiese et al, 2005;Leonard and Jackson, 2015;Juratly et al, 2015;2016) and others (Rababbah 2004;2007;Politano et al, 2014;2016;Riguzzi, 2016). In these publications, the concept of uniform random numbers in PRNG actively uses the operations of bit logic.…”

Section: Related Workmentioning

confidence: 99%

Parametrical Tuning of Twisting Generators

Deon¹,

Menyaev²

2016

Journal of Computer Science

View full text Add to dashboard Cite

Generators of uniformly distributed random numbers are broadly applied in simulations of stochastic processes that rely on normal and other distributions. In a point of fact, the uniform random numbers are actively used for applications that range from, modeling different phenomena such as theoretical mathematics and technical designing, to evidence-based medicine. This paper proposes a novel approach which consists of a combination of global twister with circular technique and initial congruential generation with complete stochastic sequences. It has been experimentally confirmed that for complete sequences this type of generation provides uniformity in distribution of random numbers. The offered program codes include the tuning methods for the generation technique where random numbers may take any bit length. Moreover, the automatic switching of generator parameters such as initial congruential constants depending on intervals for generated numbers is considered as well. Demonstrated results of testing confirm the uniformity of distribution without any repeated or skipped generated elements.

show abstract

“…Note that in contrast to most processors reported in literature [4,25,26,31], we include the number for the required storage of the secret scalar k. For an ECC point multiplication, 1,296 bits (81 entries) are necessary (we used a 16 × 84 macro in that case). For higher-level protocols, additional memory is needed (e.g.…”

Section: Memory For Program Data and Constantsmentioning

confidence: 99%

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

Wenger

Hutter

2011

Smart Card Research and Advanced Applications

View full text Add to dashboard Cite

Abstract. Elliptic Curve Cryptography (ECC) based processors have gained large attention in the context of embedded-system design due to their ability of efficient implementation. In this paper, we present a lowresource processor that supports ECC operations for less than 9 kGEs. We base our design on an optimized 16-bit microcontroller that provides high flexibility and scalability for various applications. The design allows the use of an optimized RAM-macro block and reduces the complexity by sharing various resources of the controller and the datapath. Our results improves the state of the art in low-resource F 2 163 ECC implementations (14 % less area needed compared to the best solution reported). The total size of the processor is 8,958 GEs for a 0.13 µm CMOS technology and needs 285 kcycles for a point multiplication. It shows that the proposed solution is well suitable for low-power designs by providing a power consumption of only 3.2 µW at 100 kHz.

show abstract

Low-Power Elliptic Curve Cryptography Using Scaled Modular Arithmetic

Cited by 46 publications

References 11 publications

A high-performance elliptic curve cryptographic coprocessor with side channel analysis countermeasures for smart IC card

A high-performance elliptic curve cryptographic coprocessor with side channel analysis countermeasures for smart IC card

Parametrical Tuning of Twisting Generators

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

Contact Info

Product

Resources

About