Irreducible m-Term Polynomial and Its Application to Multiplication over GF(2^m)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we present a specific type of irreducible polynomial which is an irreducible m-term polynomial of degree m. Designing the parallel multiplier over GF(2m) by the quadrinomial obtained from this irreducible polynomial, its critical delay path is smaller than that of conventional multipliers for some degree m.
- （社）電子情報通信学会の論文
- 2011-03-01
著者
-
Morii Masakatu
Graduate School Of Engineering Kobe University
-
HIROTOMO Masanori
Graduate School of Engineering, Kobe University
-
OZASA Yuko
Graduate School of Engineering, Kobe University
-
Hirotomo Masanori
Graduate School Of Engineering Kobe University
-
Ozasa Yuko
Graduate School Of Engineering Kobe University
関連論文
- A Chosen-IV Key Recovery Attack on Py and Pypy
- A-6-8 Improved Bitslice Network for Computing the TIB3 S-Box
- Fast WEP-Key Recovery Attack Using Only Encrypted IP Packets
- Reversible Watermark with Large Capacity Based on the Prediction Error Expansion
- Fingerprinting Protocol Based on Distributed Providers Using Oblivious Transfer(Cryptography,Information Theory and Its Applications)
- Reversible Watermark with Large Capacity Based on the Prediction Error
- Reversible Watermark with Large Capacity Using the Predictive Coding
- S-Box Bitslice Networks as Network Computing
- New Weakness in the Key-Scheduling Algorithm of RC4
- Internal-State Reconstruction of a Stream Cipher RC4(Information Security)(Information Theory and Its Applications)