1 |
H. Shen and Y. Jin, "Low complexity bit parallel multiplier for GF( ) generated by equally-spaced trinomials," Information Processing Letters., vol. 107, pp. 211-215, Aug. 2008.
DOI
ScienceOn
|
2 |
E.D. Mastrovito, "VLSI Architectures for Computation in Galois Fields," PhD thesis, Linkoping University Dept. Electr. Eng., Linkoping, Sweden, 1991.
|
3 |
C. Negre, "Efficient parallel multiplier in shifted polynomial basis," Journal of Systems Architecture, vol. 53, no. 2-3, pp. 109-116, Feb. 2007.
DOI
ScienceOn
|
4 |
A. Reyhani-Masoleh and M.A. Hasan, "Low complexity bit parallel architectures for polynomial basis multiplication over GF( ) ," IEEE Trans. Computers., vol. 53, no. 8, pp. 945-959, Aug. 2004.
DOI
ScienceOn
|
5 |
장남수, 김창한, 홍석희, 박영호, "삼항 기약다항식을 위한 효율적인 Shifted polynomial Basis 비트-병렬 곱셈기," 정보보호학회논문지, 19(2), pp. 49-61, 2009년 4월.
과학기술학회마을
|
6 |
H. Fan and Y. Dai, "Fast bit parallel GF( ) multiplier for all trinomials," IEEE Trans. Computers., vol. 54, no. 4, pp. 485-490, Apr. 2005.
DOI
ScienceOn
|
7 |
H. Fan and M.A. Hasan, "Relationship between GF( ) Montgomery and shifted polynomial basis multiplication algorithms," IEEE Trans. Computers., vol. 55, no. 9, pp. 1202-1206, Sep. 2006.
DOI
|
8 |
H. Fan and M.A. Hasan, "Fast Bit Parallel Shifted Polynomial Basis Multipliers in GF( ) ," IEEE Trans. Circuits & Systems-I, vol. 53, no. 12, pp. 2606-2615, Dec. 2006.
DOI
|
9 |
A. Halbutogullari and M.A. Hasan, "Mastorovito Multiplier for General Irreducible Polynomials," IEEE Trans. Comput., vol. 49, no. 5, pp. 503-518, May. 2000.
DOI
ScienceOn
|
10 |
E.D. Mastrovito, "VLSI designs for multiplication over finite fields GF( ) ," In Proceedings of the Sixth Symposium on Applied Algebra, Algebraic Algorithms, and Error Correcting Codes, vol. 6, pp. 297-309, July. 1988.
|