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


Polynomial Basis Multiplication over GF(2 m )
Authors:Serdar S Erdem  Tu?rul Yan?k  Çetin K Koç
Institution:(1) Electronics Engineering Department, Gebze Institute of Technology, Gebze, Kocaeli, Turkey;(2) Computer Engineering Department, Fatih University, Istanbul, Turkey;(3) Information Security Research Center, Istanbul Commerce University, Istanbul, Turkey
Abstract:In this paper, we describe, analyze and compare various $GF(2^m)$ multipliers. Particularly, we investigate the standard modular multiplication, the Montgomery multiplication, and the matrix–vector multiplication techniques.
Keywords:12-XX  68-XX  94-XX
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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