On the Improvement of Addition Chain in Applications to Elliptic Curve Cryptosystem Status: Submitted

A hard problem most of the time can be broken into a sequence of simple tasks from which a solution to the original problem is obtainable. Originally, elliptic curve cryptography is based on a non-singular algebraic curve of genus 1. The process of encrypting message involves modular operation of hu...

पूर्ण विवरण

ग्रंथसूची विवरण
मुख्य लेखक: Mohamed, Mohamad Afendee
स्वरूप: थीसिस
भाषा:अंग्रेज़ी
अंग्रेज़ी
प्रकाशित: 2011
विषय:
ऑनलाइन पहुंच:http://psasir.upm.edu.my/id/eprint/20042/1/IPM_2011_9_ir.pdf