Mohlo by se vám také líbit

Více informací o knize Energy-Efficient Modular Exponential Techniques for Public-Key Cryptography

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 427 bodů

Anotace knihy

Cryptographic applications, such as RSA algorithm, ElGamal cryptography, elliptic curve cryptography, Rabin cryptosystem, Diffie -Hellmann key exchange algorithm, and the Digital Signature Standard, use modular exponentiation extensively. The performance of all these applications strongly depends on the efficient implementation of modular exponentiation and modular multiplication. Since 1984, when Montgomery first introduced a method to evaluate modular multiplications, many algorithmic modifications have been done for improving the efficiency of modular multiplication, but very less work has been done on the modular exponentiation to improve the efficiency. This research monograph addresses the question- how can the performance of modular exponentiation, which is the crucial operation of many public-key cryptographic techniques, be improved? The book focuses on Energy Efficient Modular Exponentiations for Cryptographic hardware. Spread across five chapters, this well-researched text focuses in detail on the Bit Forwarding Techniques and the corresponding hardware realizations. Readers will also discover advanced performance improvement techniques based on high radix multiplication and Cryptographic hardware based on multi-core architectures.

Parametry knihy

Zařazení knihy Knihy v angličtině Computing & information technology Computer security

• Plný název: Energy-Efficient Modular Exponential Techniques for Public-Key Cryptography
• Podnázev: Efficient Modular Exponential Techniques
• Autor: Satyanarayana Vollala, N. Ramasubramanian, Utkarsh Tiwari
• Jazyk: Angličtina
• Vazba: Brožovaná
• Počet stran: 257
• EAN: 9783030745264
• ID: 39335830
• Nakladatelství: Springer Nature Switzerland AG
• Hmotnost: 433 g
• Rozměry: 235 × 155 × 16 mm
• Datum vydání: 15. July 2022

Oblíbené z jiného soudku

---

---

---