2009 Pacific-Asia Conference on Knowledge Engineering and Software Engineering 2009
DOI: 10.1109/kese.2009.55
|View full text |Cite
|
Sign up to set email alerts
|

Elliptic Curves Cryptosystem Based Electronic Cash Scheme with Parameter Optimization

Abstract: Proper selection of secret parameters is essential to the security and feasibility of e-cash (electronic cash) scheme. In the paper, we presented an improved e-cash scheme with parameter optimization based on ECC (Elliptic Curves Cryptosystem). In the scheme, the secret parameters are generated with bionic optimization algorithm by a successive adaptive optimizing process. With the optimized secret parameters, the dishonest users and the outer adversaries can not attack e-cash with polynomial algorithms, so th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…That means cryptographer elliptic curve is in the form y 2 mod p = (x 3 + ax + b) mod p where 4a 3 + 27b 2 ≠ 0 and p is a prime number and a, b is the parameter of the curve, here variables and coefficient are all restricted to elements of a finite field. There are two families of elliptic curve are used in cryptography application [8,9,10]. In Elliptic curves defined over GF (2 m ), the variables and co-efficient all take on values in GF (2 m ) and in calculation performed over GF (2 m ).…”
Section: Mathematics Behind Eccmentioning
confidence: 99%
See 2 more Smart Citations
“…That means cryptographer elliptic curve is in the form y 2 mod p = (x 3 + ax + b) mod p where 4a 3 + 27b 2 ≠ 0 and p is a prime number and a, b is the parameter of the curve, here variables and coefficient are all restricted to elements of a finite field. There are two families of elliptic curve are used in cryptography application [8,9,10]. In Elliptic curves defined over GF (2 m ), the variables and co-efficient all take on values in GF (2 m ) and in calculation performed over GF (2 m ).…”
Section: Mathematics Behind Eccmentioning
confidence: 99%
“…If we want to add two points of elliptic curve then we have to follow given below rule. For this and all arithmetic operation there are some rules which are as follows [8,9,10].…”
Section: Arithmetic Operation In Eccmentioning
confidence: 99%
See 1 more Smart Citation