Low Power FPGA Based Elliptical Curve Cryptography
نویسندگان
چکیده
منابع مشابه
Identity Based Encryption through Elliptical Curve Cryptography
Although the Boneh and Franklin identity-based encryption scheme is not overly complex theoretically, the implementation of the system proves to be somewhat difficult. 1 Identity Based Encryption: The difficulty with public key encryption involves distribution of the keys and the assumption that they will always be available (Ding 194). It is not always practical to be connected to a key certif...
متن کاملLow Power Elliptic Curve Cryptography
This M.S. thesis introduces new modulus scaling techniques for transforming a class of primes into special forms which enable efficient arithmetic. The scaling technique may be used to improve multiplication and inversion in finite fields. We present an efficient inversion algorithm that utilizes the structure of a scaled modulus. Our inversion algorithm exhibits superior performance to the Euc...
متن کاملBlind Signature Scheme Based On Elliptical Curve Cryptography ( ECC ) Preeti
Blind signature is a concept to ensure anonymity of e-coins. Untracebility and unlinkability are ttwo main properties of real coins and should also be mimicked electronicaly. A user has fulfill above two properties of blind signature for permission to send an e-coins. During the last few years, asymmetric cryptography based on curve based cryptography have becomes very popular, especially for e...
متن کاملTradeoff analysis of FPGA based elliptic curve cryptography
FPGAs are an attractive platform for elliptic curve cryptography hardware. Since field multiplication is the most critical operation in elliptic curve cryptography, we have studied how efficient several field multipliers can be mapped to lookup table based FPGAs. Furthermore we have compared different curve coordinate representations with respect to the number of required field operations, and ...
متن کاملLow-Power Elliptic Curve Cryptography Using Scaled Modular Arithmetic
We introduce new modulus scaling techniques for transforming a class of primes into special forms which enables efficient arithmetic. The scaling technique may be used to improve multiplication and inversion in finite fields. We present an efficient inversion algorithm that utilizes the structure of scaled modulus. Our inversion algorithm exhibits superior performance to the Euclidean algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOSR Journal of Electronics and Communication Engineering
سال: 2013
ISSN: 2278-8735,2278-2834
DOI: 10.9790/2834-0621114