Software implementation of pairings
Software Implementation of Pairings Page 1 Chapter XII Software Implementation of Pairings
Darrel HANKERSONa, Alfred MENEZESb and Michael SCOTT c a Auburn University, USA b …
Darrel HANKERSONa, Alfred MENEZESb and Michael SCOTT c a Auburn University, USA b …
Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition
The η T pairing in characteristic three is implemented by arithmetic in GF (3)={0, 1, 2}.
Harrison et al. reported an efficient implementation of the GF (3)-addition by using seven …
Harrison et al. reported an efficient implementation of the GF (3)-addition by using seven …
Faster maptopoint on supersingular elliptic curves in characteristic 3
Y Kawahara, T Kobayashi, G Takahashi… - IEICE transactions on …, 2011 - search.ieice.org
Pairing-based cryptosystems are generally constructed using many functions such as
pairing computation, arithmetic in finite fields, and arithmetic on elliptic curves. MapToPoint …
pairing computation, arithmetic in finite fields, and arithmetic on elliptic curves. MapToPoint …
An efficient implementation of pairing-based cryptography on MSP430 processor
In this paper, we present a highly optimized implementation of η _T η T pairing on 16-bit
MSP430 processor. Until now, TinyPBC provided the most optimized implementation of η _T …
MSP430 processor. Until now, TinyPBC provided the most optimized implementation of η _T …
Affiliation-hiding authentication with minimal bandwidth consumption
M Manulis, B Poettering - … Workshop on Information Security Theory and …, 2011 - Springer
Abstract Affiliation-Hiding Authentication (AHA) protocols have the seemingly contradictory
property of enabling users to authenticate each other as members of certain groups, without …
property of enabling users to authenticate each other as members of certain groups, without …
Use of SIMD Features to Speed up Eta Pairing
Eta pairing over supersingular elliptic curves is widely used in designing many
cryptographic protocols. Because of efficiency considerations, curves over finite fields of …
cryptographic protocols. Because of efficiency considerations, curves over finite fields of …
[PDF][PDF] SIMD-based Implementations of Eta Pairing Over Finite Fields of Small Characteristics.
AK Bhattacharya, A Das, DR Chowdhury, B Bellur… - SECRYPT, 2012 - scitepress.org
Eta pairing on supersingular elliptic curves defined over fields of characteristics two and
three is a popular and practical variant of pairing used in many cryptographic protocols. In …
three is a popular and practical variant of pairing used in many cryptographic protocols. In …
Efficient implementation of ηT pairing on supersingular elliptic curves in characteristic 3
川原祐人 - 2012 - catalog.lib.kyushu-u.ac.jp
Pairing-based cryptosystems can provide cryptographic schemes which have novel and
useful properties, such as Identity-based encryption schemes, and they have been attracted …
useful properties, such as Identity-based encryption schemes, and they have been attracted …
最小の論理命令数でのGF(3) 上の加算によるηTペアリングの高速実装
川原祐人， 青木和麻呂， 高木剛 - 情報処理学会論文誌, 2009 - ipsj.ixsq.nii.ac.jp
論文抄録 近年, ID ベース暗号などのプロトコルが構築可能であることからペアリング暗号が注目
され, それにともない, プロトコルの構築に用いるペアリング暗号を効率的に計算することが必要と …
され, それにともない, プロトコルの構築に用いるペアリング暗号を効率的に計算することが必要と …