Generic implementations of elliptic curve cryptography using partial reduction
Proceedings of the 9th ACM conference on Computer and communications security
Elliptic Curve Cryptography on a Palm OS Device
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
An End-to-End Systems Approach to Elliptic Curve Cryptography
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Addressing security in medical sensor networks
Proceedings of the 1st ACM SIGMOBILE international workshop on Systems and networking support for healthcare and assisted living environments
Modular inverse algorithms without multiplications for cryptographic applications
EURASIP Journal on Embedded Systems
Hardware architectures for the Tate pairing over GF(2m)
Computers and Electrical Engineering
Elliptic curve cryptography-based access control in sensor networks
International Journal of Security and Networks
Design and implementation of a secure wireless mote-based medical sensor network
UbiComp '08 Proceedings of the 10th international conference on Ubiquitous computing
Elliptic Curve Cryptography on FPGA for Low-Power Applications
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
SystemC-based HW/SW co-simulation platform for system-on-chip (SoC) design space exploration
International Journal of Information and Communication Technology
FPGA Implementation of Elliptic Curve Point Multiplication over GF(2191)
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
A correlation power analysis attack against tate pairing on FPGA
ARC'11 Proceedings of the 7th international conference on Reconfigurable computing: architectures, tools and applications
Efficient implementation of public key cryptosystems on mote sensors (short paper)
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
A reconfigurable implementation of the tate pairing computation over GF(2m)*
ARC'10 Proceedings of the 6th international conference on Reconfigurable Computing: architectures, Tools and Applications
Low power elliptic curve cryptography
PATMOS'07 Proceedings of the 17th international conference on Integrated Circuit and System Design: power and timing modeling, optimization and simulation
| Hi-index | 0.00 |
Euclid's method for finding the greatest common divisor(GCD) of two integers was first described around the year 300 B.C.This simple iterative method is often regarded as the grandfatherof all algorithms in Number Theory today. Many advances have beenmade since then--for example, Berlekamp's algorithm formultiplicative inverse and Montgomery's technique formodular multiplication. These binary add-and-shiftalgorithms for efficient finite field arithmetic operations haveplayed important roles in today s public-key cryptographic systems.Yet, two thousand three hundred years after Euclid's GCD, onealgorithm remained missing--division. For many decades we did nottackle modular division problems directly. Instead, we relied onthe Extended Euclidean algorithm for calculating inversion and wecomputed division in a two-step process--inversion followed bymultiplication. This practice is so deeply rooted in our teachingsand doings today that we have neglected to ask whether the ideaunderlying the binary Extended Euclidean algorithm can also beapplied to finding a general solution for field division. Thispaper describes such a solution: a binary add-and-shift algorithmfor modular division in a residue class. This technique forfast computation of divisions in GF(2m) is thekey to a highly efficient implementation of elliptic curvecryptosystems.