# Low Complexity Digit Serial Systolic Montgomery Multipliers for Special Class of ${\rm GF}(2^{m})$

@article{Talapatra2010LowCD,
title={Low Complexity Digit Serial Systolic Montgomery Multipliers for Special Class of \$\{\rm GF\}(2^\{m\})\$},
author={Somsubhra Talapatra and Hafizur Rahaman and Jimson Mathew},
journal={IEEE Transactions on Very Large Scale Integration (VLSI) Systems},
year={2010},
volume={18},
pages={847-852}
}
Montgomery Algorithm for modular multiplication with a large modulus has been widely used in public key cryptosystems for secured data communication. This paper presents a digit-serial systolic multiplication architecture for all-one polynomials (AOP) over GF(2m) for efficient implementation of Montgomery Multiplication (MM) Algorithm suitable for cryptosystem. Analysis shows that the latency and circuit complexity of the proposed architecture are significantly less than those of earlier… CONTINUE READING
Highly Cited
This paper has 32 citations. REVIEW CITATIONS

#### References

##### Publications referenced by this paper.
SHOWING 1-8 OF 8 REFERENCES

## Fast BBS - sequence generation using Montgomery multiplication

• A. H. Kemp, S. J. Shepherd
• IEEE Trans . Computers
• 2002