129,95 €
129,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
65 °P sammeln
129,95 €
129,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
65 °P sammeln
Als Download kaufen
129,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
65 °P sammeln
Jetzt verschenken
129,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
65 °P sammeln
  • Format: PDF

This unique and focused 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? ¿ Cryptographic applications--such as RSA algorithms, ElGamal cryptography, elliptic-curve cryptography, Rabin cryptosystems, Diffie -Hellmann key-exchange algorithms, 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.…mehr

Produktbeschreibung
This unique and focused 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? ¿
Cryptographic applications--such as RSA algorithms, ElGamal cryptography, elliptic-curve cryptography, Rabin cryptosystems, Diffie -Hellmann key-exchange algorithms, 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.
The book focuses on energy-efficient modular exponentiation for cryptographic hardware. Spread across five chapters, this well-researched text focuses in detail on 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.
Satyanarayana Vollala is a full-time Ph.D. research scholar in the Department of Computer Science and Engineering at National Institute of Technology, Tiruchirappalli, Tamil Nadu, India. N. Ramasubramanian is an associate professor in the Department of Computer Science and Engineering at National Institute of Technology, Tiruchirappalli, India.

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Autorenporträt
Dr. Satyanarayana Vollala is an Assistant Professor in Computer Science and Engineering discipline at IIIT Naya Raipur, Chhattisgarh. He was a recipient of TEQIP (President) Fellowship for his doctoral research at National Institute of Technology, Tiruchirappalli. His research interests are: Hardware Cryptography, Public-Key Cryptography, Number Theory and Theoretical Computer Science.
Dr. N Ramasubramanian is a Professor in the Department of Computer Science and Engineering at NIT-Trichy, India. His research interests are Multi-core Computer Architecture, Advanced Digital Design, Reconfigurable computing, Processor Design, Software for Embedded Applications, Hardware for Security Systems, GPU Computing, IoT Architectures.
Mr. Utkarsh Tiwari is a PhD Scholar in Computer Science and Engineering discipline at IIIT Naya Raipur, Chhattisgarh. He is working as a JRF for the DST India funded project. He has done M.Techfrom IIIT Bhubaneswar in 2015, Worked as adjunct assistant professor at VNIT Nagpur and NIT Raipur for one year each, having 2 year of industrial experience at Infosys ltd. His research interests are: Network Security, Hardware Cryptography and Bioinformatics.