Bit‐parallel systolic multiplier over GF(2m) for irreducible trinomials with ASIC and FPGA implementations

Cryptography in digital world must offer integrity and confidentiality using cryptographic algorithms which mainly involve multiplication operation in finite fields. Various algorithms and architectures are proposed in the literature to obtain efficient finite field multiplications in both hardware...

Full description

Saved in:

Bibliographic Details
Published in:	IET circuits, devices & systems Vol. 12; no. 4; pp. 315 - 325
Main Authors:	Mathe, Sudha Ellison, Boppana, Lakshmi
Format:	Journal Article
Language:	English
Published:	Stevenage The Institution of Engineering and Technology 01.07.2018 John Wiley & Sons, Inc
Subjects:	Algorithms application specific integrated circuit Application specific integrated circuits ASIC bit-parallel systolic multiplier Complexity computational complexity Computer program integrity cryptographic algorithms Cryptography Data encryption Delay delay complexity analysis Design Field programmable gate arrays field-programmable gate array Fields (mathematics) finite field multiplications FPGA Hardware Integrated circuits irreducible trinomials m-bit systolic multiplier modified interleaved multiplication algorithm Multipliers multiplying circuits Polynomials Power management power-delay products precomputation technique SMT structure
ISSN:	1751-8598, 1751-858X, 1751-8598
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!