000			03617nam a22003975i 4500
999			_c361403 _d361403 _x1
001			361403
003			ES-MaUEC
005			20230102121353.0
006			a||||fo|||| 00| 0
007			cr nn nnnaamaa
008			210713s2021 gw | s |||| 0|eng d
020			_a9783030745240
024	7		_a10.1007/978-3-030-74524-0 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.9 .A25 _b2021 EB
100	1		_aVollala, Satyanarayana _eautor _9680848
245	1	0	_aEnergy-Efficient Modular Exponential Techniques for Public-Key Cryptography : _bEfficient Modular Exponential Techniques _cby Satyanarayana Vollala, N. Ramasubramanian, Utkarsh Tiwari
250			_aFirst edition 2021
264		1	_aCham _bSpringer International Publising _c2021
300			_a1 recurso en línea (XX, 257 páginas) _b133 ilustraciones, 21 ilustraciones a color
336			_2rdacontent _aTexto _btxt
337			_2rdamedia _aelectrónico _bc
338			_2rdacarrier _arecurso electrónico _bcr
347			_aarchivo de texto _bPDF
490	0		_aComputer Science (SpringerNature-11645)
490	0		_aComputer Science (R0) (SpringerNature-43710)
505	0		_aChapter 1. Introduction -- Chapter 2. Public-Key Cryptographic Algorithms and Techniques -- Chapter 3. Modular Exponentiations and Modular Multiplication -- Chapter 4. Improving the Performance of Public-Key Techniques -- Chapter 5. Hardware Implementation of Bit Forwarding Techniques -- Chapter 6. Improved Hardware Realization for Public-key Transformations -- Chapter 7. Conclusion
520	3		_aThis 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.
988			_aSpringer_Computer_2021
650		7	_2embne _aCriptografía (Informática) _9158201
700	1		_aRamasubramanian, N _eautor
700	1		_aTiwari, Utkarsh _eautor
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-030-74524-0 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b01/2022 _dz _eu _zSI