490 Hits in 5.4 sec

How to Use Koblitz Curves on Small Devices? [chapter]

Kimmo Järvinen, Ingrid Verbauwhede
2015 Lecture Notes in Computer Science  
This results in a need for conversions between integers and the τ -adic domain, which are costly and prevent from using Koblitz curves on very constrained devices, such as RFID tags or wireless sensors  ...  We also provide small circuitries that require about 76 gate equivalents on 0.13 µm CMOS and that are applicable for all Koblitz curves.  ...  We would like to thank the anonymous reviewers for their valuable comments and improvement suggestions.  ... 
doi:10.1007/978-3-319-16763-3_10 fatcat:we6nbyanhjf7ljzo6gqkku6sye

Elliptic Curve Cryptography on a Palm OS Device [chapter]

André Weimerskirch, Christof Paar, Sheueling Chang Shantz
2001 Lecture Notes in Computer Science  
One requirement for further growing of eCommerce with mobile devices is the provision of security. We implemented elliptic curves over binary fields on a Palm OS device.  ...  Using Koblitz curves a typical security protocol like Diffie-Hellman key exchange or ECDSA signature verification requires less than 2.4 seconds, while ECDSA signature generation can be done in less than  ...  Conclusion We implemented a NIST recommended random and Koblitz curve over GF (2 163 ) on a Palm OS device.  ... 
doi:10.1007/3-540-47719-5_39 fatcat:dmfj3te42raghncm3vrnvluzwy

Low-energy encryption for medical devices

Junfeng Fan, Oscar Reparaz, Vladimir Rožić, Ingrid Verbauwhede
2013 Proceedings of the 50th Annual Design Automation Conference on - DAC '13  
Smart medical devices will only be smart if they also include technology to provide security and privacy.  ...  To provide a variety of security features, including location privacy, it is clear that medical devices need public key cryptography (PKC).  ...  Elliptic curve cryptography is a favorable choice due to its relatively small key size and high security level compared to RSA.  ... 
doi:10.1145/2463209.2488752 dblp:conf/dac/FanRRV13 fatcat:f4qeuxyc3jekncgbsqlcqhcsmu

Construction of an elliptic curve over finite fields to combine with convolutional code for cryptography

B. Ontiveros, I. Soto, R. Carrasco
2006 IEE Proceedings - Circuits Devices and Systems  
When using elliptic curves and codes for cryptography it is necessary to construct elliptic curves with a given or known number of points over a given finite field, in order to represent the input alphabet  ...  A list of the suitable elliptic curves and the study of time to construction elliptic curves is presented.  ...  Acknowledgements The authors would like to thank PBCT/CONICYT ACT11/04 -Chile, for their financial support.  ... 
doi:10.1049/ip-cds:20050117 fatcat:uw73zprrmvawdkpxg7l7hrkeeq

Performance Analysis of Light Weight Security Algorithms for Resource Constrained Devices

Khan Riaz
2019 Zenodo  
Being a distributed system of constrained devices, this data needs to be communicated securely without wasting the resources of constrained devices.  ...  The algorithms are first theoretically analyzed followed by their implementation on Cryptool and Raspberry Pi in order to check their efficacy.  ...  On the high end of the device band there are servers and desktop hosts followed by small tablets and smartphones.  ... 
doi:10.5281/zenodo.2602959 fatcat:pzvstl6lpnf7zmomcibcfmlvsm

Efficient Java Implementation of Elliptic Curve Cryptography for J2ME-Enabled Mobile Devices [chapter]

Johann Großschädl, Dan Page, Stefan Tillich
2012 Lecture Notes in Computer Science  
However, most existing implementations of elliptic curve (EC) cryptography for J2ME do not perform well on resource-restricted devices, in most cases due to poor efficiency of the underlying arithmetic  ...  More precisely, our implementation uses a pseudo-Mersenne (PM) prime field for fast modular reduction and a Gallant-Lambert-Vanstone (GLV) curve with an efficiently computable endomorphism to speed up  ...  However, GLV curves have a special structure that could reduce the time required to compute EC discrete logarithms by "a small factor" [12, Section 5] , similar to Koblitz curves [29] .  ... 
doi:10.1007/978-3-642-30955-7_17 fatcat:dniy2q6w3rec3dwo2pdemyurri

A Practical Evaluation on RSA and ECC-Based Cipher Suites for IoT High-Security Energy-Efficient Fog and Mist Computing Devices

Manuel Suárez-Albela, Paula Fraga-Lamas, Tiago Fernández-Caramés
2018 Sensors  
Thanks to recent advances in System-on-Chip (SoC) energy efficiency, it is currently possible to create IoT end devices with enough computational power to process the data generated by their sensors and  ...  The testbed makes use of Transport Layer Security (TLS) 1.2 Elliptic Curve Cryptography (ECC) and Rivest-Shamir-Adleman (RSA) cipher suites (that comply with the yet to come TLS 1.3 standard requirements  ...  to accommodate on personal computers or Small and Medium-sized Enterprise (SMEs) mainframes.  ... 
doi:10.3390/s18113868 pmid:30423831 fatcat:t7kxdouuqrej5dqznxllqg22tu

An Experimental Study on Energy Consumption of Cryptographic Algorithms for Mobile Hand-Held Devices

K. SathishKumar, R. Sukumar, P. Asrin Banu
2012 International Journal of Computer Applications  
Due to the continuous advancement in technology, mobile devices are playing important role in everyone"s day to day life.  ...  While designing, a lot of care has to be taken especially in power optimization because there is no regular power supply in this kind of devices.  ...  However, ECC itself only require small increase in the number of bits in its keys in order to achieve a higher security.ECC consists of a few basic operations and rules that define how addition, subtraction  ... 
doi:10.5120/4917-7138 fatcat:krnuvsnh65fdpe7pqh7mvw5eim

Towards Efficient FPGA Implementation of Elliptic Curve Crypto-Processor for Security in IoT and Embedded Devices

Shaimaa Abu Khadra, Salah Eldin S. E. Abdulrahman, Nabil A. Ismail
2020 Menoufia Journal of Electronic Engineering Research  
An Elliptic Curve Crypto-Processor (ECCP) is a favorite public-key cryptosystem due to its small key size and its high security arithmetic unit.  ...  So, the objective is to implement the main operation of Point Multiplication (PM) 𝑄 = 𝑘𝑃 using FPGA.  ...  On the other hand, this is an indication that the future work needs to address how to develop a methodology to optimize the amount of power dissipation by the finite field multiplier.  ... 
doi:10.21608/mjeer.2020.103280 fatcat:geqy5bsvlvcinm6j2p4inkonoa

Multiprotocol Authentication Device for HPC and Cloud Environments Based on Elliptic Curve Cryptography

Antonio F. Díaz, Ilia Blokhin, Mancia Anguita, Julio Ortega, Juan J. Escobar
2020 Electronics  
The proposed electronic token (eToken), based on the system-on-chip ESP32, provides an extra layer of security based on elliptic curve cryptography.  ...  Thanks to advances in system-on-chip devices, we can integrate cryptographically robust, low-cost solutions.  ...  Used The algorithms we use are mainly based on: one-way hash functions, elliptic curve cryptography, Elliptic Curve Integrated Encryption Scheme (ECIES), and true random number generators (TRNG).  ... 
doi:10.3390/electronics9071148 fatcat:muydtjy2jbaq5p46pqcgdety2m

Field Programmable Gate Array based elliptic curve Menezes‐Qu‐Vanstone key agreement protocol realization using Physical Unclonable Function and true random number generator primitives

N. Nalla Anandakumar, Mohammad S. Hashmi, Somitra Kumar Sanadhya
2022 IET Circuits, Devices & Systems  
The key agreement protocols, which establish a shared secret key between two IoT devices, make use of PUF and TRNG primitives for the long-and short-term secret keys generation while the elliptic curve  ...  The performance of the protocol is investigated on FPGAs. The authors' implementation of the ECMQV protocol takes 1.802 ms using 18852 slices on Artix-7 FPGA.  ...  Moreover, the Elliptic curves are represented in distinct ways such as Hessian curves [14] , binary Koblitz curves (BKC) [15] , binary generic (Weierstrass) curves (binary generic curve (BGC)) [16]  ... 
doi:10.1049/cds2.12111 fatcat:acpd6p6cbjahrdkdkvyf5ekmka

Defeating Simple Power Analysis on Koblitz Curves

2006 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
Koblitz curves belong to a special class of binary curves on which the scalar multiplication can be computed very efficiently.  ...  In this paper, we propose a new countermeasure against side channel attacks on Koblitz curves, which utilizes a fixed-pattern recoding to defeat simple power analysis.  ...  One possible solution is to use elliptic curves defined over binary fields: such binary curves rely on simple and carry-less operations such as shift and xor.  ... 
doi:10.1093/ietfec/e89-a.5.1362 fatcat:iigji4eecvbunhgoszzd4tft74

Side-Channel Analysis of Weierstrass and Koblitz Curve ECDSA on Android Smartphones [chapter]

Pierre Belgarric, Pierre-Alain Fouque, Gilles Macario-Rat, Mehdi Tibouchi
2016 Lecture Notes in Computer Science  
We then extend the standard lattice attack on ECDSA over prime fields to binary Koblitz curves. This is the first time that such an attack is described on Koblitz curves.  ...  We show that, for elliptic curves over prime fields, one can recover the secret key very efficiently on smartphones using electromagnetic side-channel and well-known lattice reduction techniques.  ...  We recover the private key using very few signatures either on prime field curves or on Koblitz ones.  ... 
doi:10.1007/978-3-319-29485-8_14 fatcat:luuh3557azafvkch2dkhc2p3d4

Koblitz curve cryptosystems

Tanja Lange
2005 Finite Fields and Their Applications  
Hyperelliptic curves over finite fields are used in cryptosystems. To reach better performance, Koblitz curves, i.e. subfield curves, have been proposed.  ...  For hyperelliptic curves, this paper is the first to give a proof on the finiteness of the Frobenius-expansions involved, to deal with periodic expansions, and to give a sound complexity estimate.  ...  Acknowledgments This work evolved from my Ph.D. thesis, I express my deepest gratitude to my supervisor Gerhard Frey for everything he did. I would also like to thank Guillaume  ... 
doi:10.1016/j.ffa.2004.07.001 fatcat:d3nea6c2srghln4ospsyzhvxne

Fast point multiplication on Koblitz curves: Parallelization method and implementations

Kimmo Järvinen, Jorma Skyttä
2009 Microprocessors and microsystems  
Koblitz curves are a family of curves defined over F 2 m allowing notably faster computation. We discuss implementation of point multiplication on Koblitz curves with parallel field multipliers.  ...  They compute point multiplications on average in 4.9 ls, 8.1 ls, and 12.1 ls on the standardized curves NIST K-163, K-233, and K-283, respectively, in an Altera Stratix II FPGA.  ...  (1) We present a simple and efficient method for speeding up Koblitz  ... 
doi:10.1016/j.micpro.2008.08.002 fatcat:5mlvg4ysvfe3rdsesgb7n6qm7q
« Previous Showing results 1 — 15 out of 490 results