id: 05860681
dt: a
an: 05860681
au: Jeon, Jun-Cheol; Yoo, Kee-Young
ti: Computational algorithm and architecture for $AB^{2}$ multiplication in
    finite fields.
so: Kumar, Vipin (ed.) et al., Computational science and its applications ‒
    ICCSA 2003. International conference, Montreal, Canada, May 18‒21,
    2003. Proceedings, Part I. Berlin: Springer (ISBN 3-540-40155-5/pbk).
    Lecture Notes in Computer Science 2667, 947-956 (2003).
py: 2003
pu: Berlin: Springer
la: EN
cc: 
ut: 
ci: 
li: doi:10.1007/3-540-44839-X_100
ab: Summary: In this paper, we present an effective algorithm and a simple
    hardware structure for the implementation of $AB ^{2}$ multiplication
    using irreducible all one polynomial (AOP) in finite field GF$(2^{m})$.
    We argue with a problem that conventional algorithms using irreducible
    AOP are operated in extended basis, then we propose an effective
    algorithm and an architecture which are operated in the polynomial
    basis. The proposed algorithm is substantially considered relationships
    between operands based on inner-product computation. Based on the
    algorithm, we propose an architecture in which its results can be
    immediately used for other operations. Specially, the algorithm and
    architecture are useful conception for modular exponentiation since
    exponentiation is computed by repetition of $AB ^{2}$ multiplication.
rv: