Abstract
ABSTRACTIn this study, we present a polynomial basis multiplication architecture based on cellular systolic hardware architecture for Montgomery multiplication over Galois fields by adopting a qualified Montgomery factor which is highly suitable for the design on our structures. At first, we propose a parallel computation algorithm which operates two independent computations. The algorithm is efficiently designed by reordering the sequence of the terms on the polynomial. Second, we construct an ideal architecture which is composed of two independent parts. Our architecture is possible to compute two parts simultaneously. Each part is composed of same cell structures so that it is easy to be generalized and scalable. Finally, we obtain a time-saved architecture in a large degree with high scalability.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have