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...
Main Author: | Mohamed, Mohamad Afendee |
---|---|
Format: | Thesis |
Language: | English English |
Published: |
2011
|
Subjects: | |
Online Access: | http://psasir.upm.edu.my/id/eprint/20042/1/IPM_2011_9_ir.pdf |
Similar Items
-
Enhancement of {0, 1, 3}-NAF Recoding Algorithm using Block Method Technique for Elliptic Curve Cryptosystem
by: Bafandehkar, Mohsen
Published: (2015) -
Application of mathematical optimization in elliptic curve arithmetic
by: Alexander Igorevich Skripko, et al.
Published: (2017-07-01) -
Families of elliptic curves with rational 3-torsion
by: Moody Dustin, et al.
Published: (2012-02-01) -
An improved public key cryptography based on the elliptic curve
by: Al-Daoud, Essam Faleh
Published: (2002) -
Automated Correctness Proof of Algorithm Variants in Elliptic Curve Cryptography
by: M. . Anikeev, et al.
Published: (2010-12-01)