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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IET circuits, devices & systems Ročník 12; číslo 4; s. 315 - 325
Hlavní autoři:	Mathe, Sudha Ellison, Boppana, Lakshmi
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Stevenage The Institution of Engineering and Technology 01.07.2018 John Wiley & Sons, Inc
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!