首页 | 本学科首页   官方微博 | 高级检索  
     


A fast parallel implementation of elliptic curve point multiplication over GF(2m)
Affiliation:1. Institut für Informatik, Johannes Gutenberg-Universität Mainz, Mainz 55128, Germany;2. School of Computational Science & Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA;1. Communication and Information Security Lab, Institute of Big Data Technologies, Shenzhen Graduate School, Peking University, China;2. Nanyang Technological University, Singapore
Abstract:A fast parallel architecture for the implementation of elliptic curve scalar multiplication over binary fields is presented. The proposed architecture is implemented on a single-chip FPGA device using parallel strategies that trades area requirements for timing performance. The results achieved show that our proposed design is able to compute GF(2191) elliptic curve scalar multiplication operations in 63 μs.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号