Abstract

Based on a reformulated Euclidean algorithm, systolic architectures for computing inverses in finite fields have been designed with small critical path delay, O(m) latency, and O(m/sup 2/) area-time product.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call