A Novel Realization of Threshold Schemes over Binary Field Extensions
スポンサーリンク
概要
- 論文の詳細を見る
This paper presents a novel technique to realize Karnin et al.s (k,n)-threshold schemes over binary field extensions as a software. Our realization uses the matrix representation of finite fields and matrix-vector multiplications, and enables rapid operations in software implementation. The theoretical evaluation and computer simulation reveal that our realization of Karnin et al.s scheme achieves much faster processing time than the ordinary symbol oriented realization of the scheme. Further, we show that our realization has comparable performance to the existing exclusive-OR-based fast schemes of Fujii et al. and Kurihara et al.
- 2011-06-01
著者
-
Uyematsu Tomohiko
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Kurihara Jun
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
関連論文
- Secret Key Agreement by Soft-Decision of Signals in Gaussian Maurer's Model
- Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet(Source Coding,Information Theory and Its Applications)
- FOREWORD
- Decodability of Network Coding with Time-Varying Delay and No Buffering
- Universal Coding for Correlated Sources with Complementary Delivery(Information Theory and Its Applications)
- Universal source coding for complementary delivery
- Information-theoretical analysis of index searching : Revised
- Multiterminal source coding with complementary delivering(HISC2006)
- Fixed-Slope Universal Lossy Coding for Individual Sequences and Nonstationary Sources
- Network Design for Multi-Layered Photonic IP Networks Considering IP Traffic Growth(Internet)