Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity

Akleylek S., ÖZBUDAK F.

IEEE TRANSACTIONS ON COMPUTERS, cilt.61, sa.3, ss.427-432, 2012 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 61 Sayı: 3
  • Basım Tarihi: 2012
  • Doi Numarası: 10.1109/tc.2011.29
  • Dergi Adı: IEEE TRANSACTIONS ON COMPUTERS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.427-432
  • Anahtar Kelimeler: Galois field arithmetic, redundant representation, elliptic curve cryptography, VLSI implementation, ELEMENTS
  • Ondokuz Mayıs Üniversitesi Adresli: Evet

Özet

We give a modified redundant representation for designing arithmetic circuits with small complexity. Using our modified redundant representation, we improve many of the complexity values significantly. Our method works for any finite field. We also give some applications in cryptography.