Implementation of IP cores dedicated to cryptography

dc.contributor.authorAlouani, Brahim
dc.date.accessioned2015-06-10T10:10:20Z
dc.date.available2015-06-10T10:10:20Z
dc.date.issued2012
dc.description87 p. : ill. ; 30 cmen_US
dc.description.abstractThis work consists to implement IP cores dedicated to cryptography, using an FPGA as a hardware working platform and VHDL as a hardware description language. The cryptography can be classified into two main parts. Secret key and public key encryption. The last one is more complicated because it uses hard arithmetic; the RSA (Rivest, Shamir, and Adleman), DH (Diffie-Hellman Key Agreement) and the elliptic curve algorithm (ECC) are the most used public key protocols in cryptography. The modular exponentiation is the core operation in these protocols. The security of these systems depends directly on the key bit lenght, in practice (between 160 and 1024 bits or more in some applications). A high bit length and complicated operations as the modular arithmetic make the hardware solution better in different applications. The modular exponentiation can be done by successive operations of modular multiplication, that is why we chose modular multiplication as a problematic in this report. Montgomery and the interleaved are the most modular product algorithms appropriate to hardware design. In our case; we chose an optimized version of Montgomeryen_US
dc.identifier.urihttps://dspace.univ-boumerdes.dz123456789/1564
dc.language.isoenen_US
dc.subjectAlgorithmsen_US
dc.subjectCryptographyen_US
dc.subjectAlgorithmesen_US
dc.subjectCryptographieen_US
dc.titleImplementation of IP cores dedicated to cryptographyen_US
dc.typeThesisen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Alouani Brahim magister .pdf
Size:
1.28 MB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:

Collections