Parallel Algorithms for Cryptosystem on Conic Curves over Finite Field Fp

Li, Yongnan; Xiao, Limin; Yao-hui, HU; Liang, Ailin; Tian, Li

doi:10.1109/gcc.2010.42

Cited by 8 publications

(9 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As depicted in [17,18], time complexities of basic operations are listed in table 1. And we set the runtime of single-precision multiplication as the basic measurement unit.…”

Section: Time Complexities Of Basic Operationsmentioning

confidence: 99%

“…An important property of lucas function to increase the performance of LUC cryptosystem computation is introduced in [16]. Our previous works in [17,18] present basic parallel algorithms for cryptosystem on conic curves over finite field Fp and ring Zn. Nevertheless, there is no existing research about parallel point-multiplication for conic curves cryptosystem.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Parallel Point-Multiplication for Conic Curves Cryptosystem

Xiao

2010

2010 3rd International Symposium on Parallel Architectures, Algorithms and Programming

View full text Add to dashboard Cite

Cryptosystem on conic curves, which is a new developing cryptography, becomes more widespread in these days. It is important to explore fast parallel algorithms to both encrypt and decrypt information in conic curves cryptosystem. Point-multiplication is the key operation for constructing security protocol in conic curves cryptosystem. There is no existing research focused on paralleling point-multiplication for conic curves cryptosystem. This paper presents parallel computation of point-multiplication for conic curves cryptosystem over finite field Fp and ring Zn. Research in this paper is based on our previous works about several parallel algorithms for conic curves cryptosystem. The parallel technique of point-multiplication is computing point-addition and pointdouble respectively. The performance evaluation demonstrates that our methodology could improve efficiency for conic curves cryptosystem over finite field Fp and ring Zn.

show abstract

“…As depicted in [17,18], time complexities of basic operations are listed in table 1. And we set the runtime of single-precision multiplication as the basic measurement unit.…”

Section: Time Complexities Of Basic Operationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Parallel Point-Multiplication for Conic Curves Cryptosystem

Xiao

2010

2010 3rd International Symposium on Parallel Architectures, Algorithms and Programming

View full text Add to dashboard Cite

show abstract

“…A parallel algorithm for computation of inverses of matrices modulo n is introduced in [15]. Our previous works in [16] present several parallel algorithms for cryptosystem on conic curves over finite field Fp. Nevertheless, there is no existing research about the parallel algorithms of point-addition and point-double in conic curves cryptosystem over ring Zn.…”

Section: Introductionmentioning

confidence: 99%

Parallel Point-Addition and Point-Double for Cryptosystem on Conic Curves over Ring Zn

Xiao

Liang

et al. 2010

2010 International Conference on Parallel and Distributed Computing, Applications and Technologies

Self Cite

View full text Add to dashboard Cite

Conic curves cryptosystem is a new technology for achieving information security. Point-addition and pointdouble are fundamental operations in conic curves cryptosystem over ring Zn. There is no existing research about the parallel computation for conic curves cryptosystem over ring Zn. This paper proposes parallel algorithms of point-addition and point-double for cryptosystem on conic curves over ring Zn. Additionally, we present a methodology to simplify the operation of computing greatest common factor by replacing it using two reduction operations in this cryptosystem. Research in this paper is based on our previous works about parallel algorithms for conic curves cryptosystem over finite field Fp. We design the parallel algorithms by analyzing basic multipleprecision algorithms used in these operations. The performance evaluation demonstrates that our methodology could improve efficiency for conic curves cryptosystem over ring Zn.

show abstract

“…Therefore, it is important to design highspeed parallel algorithms for both encryption and decryption. We have done some works regarding the parallel algorithms for conic curves cryptosystem over finite field Fp and ring Zn [6][7][8][9][10][11]. Finite field GF (2 n ) is one of the common used mathematical sets for constructing cryptosystems including elliptic curves cryptography [12,13] and conic curves cryptography.…”

Section: Introductionmentioning

confidence: 99%