Cryptographic Algorithms on Reconfigurable Hardware by Francisco Rodriguez-Henriquez, N.A. Saqib, Arturo Díaz

By Francisco Rodriguez-Henriquez, N.A. Saqib, Arturo Díaz Pérez, Cetin Kaya Koc

This publication covers the learn of computational tools, machine mathematics algorithms, and layout development ideas had to enforce effective cryptographic algorithms in FPGA reconfigurable systems. The strategies and methods reviewed during this booklet will make specified emphasis at the functional points of reconfigurable layout, explaining the elemental arithmetic similar and giving a finished description of state of the art implementation recommendations. The authors convey how high-speed cryptographic algorithms implementations will be completed on reconfigurable units with out posing prohibited excessive standards for assets. the cloth during this e-book could be of curiosity to engineering execs, programmers, designers, and graduate scholars attracted to the advance of defense and cryptographic mechanisms at a beginning/intermediate level.

Show description

Read or Download Cryptographic Algorithms on Reconfigurable Hardware PDF

Similar information theory books

Communication Researchers and Policy-making: An MIT Press Sourcebook (MIT Press Sourcebooks)

Because the worldwide details infrastructure evolves, the sector of verbal exchange has the chance to resume itself whereas addressing the pressing coverage want for brand new methods of considering and new facts to contemplate. verbal exchange Researchers and Policy-making examines various relationships among the verbal exchange learn and coverage groups over greater than a century and the problems that come up out of these interactions.

Additional resources for Cryptographic Algorithms on Reconfigurable Hardware

Example text

In general, the weakest algorithm and key size used for cryptographic protection determines the strength of the protection provided to the system. As an example, if SHA-512 is used with 1024-bit RSA, only 80-bit of security strength will be provided to data application. If the application requires 128 bits of security, then 3072-bit RSA key must be used. Alternatively, 256-bit ECC can be used to substitute RSA as a public key cryptographic engine. 1 compares the security strengths of a set of algorithms divided into three categories: Symmetric block cipher algorithms, pubhc key cryptosystems and hash functions.

3. 3. 3, it is clear that most cryptographic algorithms include bitwise operations such as XOR, AND/OR, etc. Those operations can be nicely implemented on hardware platforms. Long word length is another peculiarity of cryptographic algorithms, which is recommended by various international standards in order to attain sufficient security against brute force attacks. The long key/word length of cryptographic algorithms is an obstacle for parallel dataflow on 8, 16, 32-bit general-purpose processors resulting on high time delays for the execution of crypto algorithms.

T h e number of 2. T h e coeffcients 3. A base point P a prime order. 4. T h e order n of 5. T h e cofactor h field elements (finite field order) q. a , 6 G Fg t h a t define t h e eUiptic equation E over Fg. = (xp, yp) e¥q t h a t belongs to t h e curve E. P must have P. - #E{¥q)/n. E C D S A Key Generation Let P e E{¥q) with order n, where E is an elliptic curve as defined above. We consider t h e field order q, the elliptic curve equation E and t h e base point P as public domain p a r a m e t e r s .

Download PDF sample

Rated 4.32 of 5 – based on 5 votes

Published by admin