搜索历史记录选项已关闭,请开启搜索历史记录选项。
作者: Daniel V. Bailey , Christof Paar
DOI: 10.1007/S001450010012
关键词:
摘要: … field used to achieve fast finite field arithmetic which we call an Optimal Extension Field (… We extend this work by presenting an adaptation of Itoh and Tsujii’s algorithm for finite field …
international conference on the theory and application of cryptology and information security,2003, 引用: 14
,2003, 引用: 3
Computer Engineering,2008, 引用: 0
international conference on computational science and its applications,2014, 引用: 4
Advances in Cryptology – EUROCRYPT 2012,2012, 引用: 54
,2001, 引用: 13
public key cryptography,2003, 引用: 9
Cryptographic Engineering,2009, 引用: 4
international symposium on circuits and systems,2003, 引用: 0
,2000, 引用: 0