C.I.E – Carta di Identità Elettronica Functional Specification Version 2.0
CIE - Functional Specification v 2.0
CIE - Functional Specification v 2.0
- No tags were found...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
13. Cryptographic algoritmsThis annex describes the crypto used in CIE and it’s split in two parts:• Asymmetric Algorithms: RSA• Symmetric Algorithms: DES, 3DES, MAC313.1 RSA (Rimvest-Shamir-Adleman)In this section, the following notation will be followed:Symbol DescriptionpqNedMCFirst secret primeSecond secret primeModulus (N=p*q)Public exponentPrivate exponentPlain dataCiphered dataTable 61: Symbols legendThe public transformation in RSA (used for encipher a plaintext or verify a <strong>di</strong>gital signature) isdefined from the mathematical operation:C = M e mod NThe private transformation in RSA (used for decipher a cipher text or to sign <strong>di</strong>gitally) is definedfrom the mathematical operation:M = C d mod NThe command GENERATE KEY PAIR in the CIE generates a key pair having the followingcharacteristics:• The modulus N is an 1024 bits long integer.• The length in bits of the public exponent e is in the range from 16 to 64.CIE - <strong>Functional</strong> <strong>Specification</strong> v <strong>2.0</strong> -Page 72/76