Low-Complexity Multiplier Architectures for Single and Hybrid-Double Multiplications in Gaussian Normal Bases

@article{Azarderakhsh2013LowComplexityMA,
  title={Low-Complexity Multiplier Architectures for Single and Hybrid-Double Multiplications in Gaussian Normal Bases},
  author={Reza Azarderakhsh and Arash Reyhani-Masoleh},
  journal={IEEE Transactions on Computers},
  year={2013},
  volume={62},
  pages={744-757}
}
The extensive rise in the number of resource constrained wireless devices and the needs for secure communications with the servers imply fast and efficient cryptographic computations for both parties. Efficient hardware implementation of arithmetic operations over finite field using Gaussian normal basis is attractive for public key cryptography as it provides free squarings. In this paper, we first present two low-complexity digit-level multiplier architectures. It is shown that the proposed… CONTINUE READING
Highly Cited
This paper has 40 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 30 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 35 references

IEEE Standard Specifications for Public-Key Cryptography

  • IEEE Std 1363-2000
  • Jan. 2000.
  • 2000
Highly Influential
7 Excerpts

Symmetry and Duality in Normal Nasis Multiplication

  • W. Geiselmann, D. Gollmann
  • Proc. Sixth Symp. Applied Algebra, Algebraic…
  • 1989
Highly Influential
9 Excerpts

Computational Method and Apparatus for Finite Arithmetic, US Patent 4587627

  • J. Massey, J. Omura
  • 1986
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…