Skip to main navigation Skip to search Skip to main content

Parallel algorithms for cryptosystem on conic curves over finite field Fp

  • Yongnan Li*
  • , Limin Xiao
  • , Yaohui Hu
  • , Aihua Liang
  • , Li Tian
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Existing algorithms in conic curves cryptosystem are all sequential ones. It is important to have fast parallel algorithms to both encrypt and decrypt data for cryptosystem on conic curves. This paper proposes our own parallel algorithms for conic curves cryptosystem over finite field Fp. Our main works are paralleling the basic multiple-precision integer algorithms and the point-addition operation on conic curves over finite field Fp. We also calculate the speedup ratio based on computing the runtime of sequential arithmetic and parallel arithmetic in this cryptosystem. The performance evaluation demonstrates that our methodology could reduce time complexity and improve efficiency for conic curves cryptosystem over finite field Fp.

Original languageEnglish
Title of host publicationProceedings - 9th International Conference on Grid and Cloud Computing, GCC 2010
Pages163-167
Number of pages5
DOIs
StatePublished - 2010
Event9th International Conference on Grid and Cloud Computing, GCC 2010 - Nanjing, Jiangsu, China
Duration: 1 Nov 20105 Nov 2010

Publication series

NameProceedings - 9th International Conference on Grid and Cloud Computing, GCC 2010

Conference

Conference9th International Conference on Grid and Cloud Computing, GCC 2010
Country/TerritoryChina
CityNanjing, Jiangsu
Period1/11/105/11/10

Keywords

  • Conic curves
  • Finite field Fp
  • Multiple-precision integer algorithm
  • Parallel algorithm
  • Point-addition

Fingerprint

Dive into the research topics of 'Parallel algorithms for cryptosystem on conic curves over finite field Fp'. Together they form a unique fingerprint.

Cite this