Many applications require the ability reproduce individ-ual
| 646 |
|
|||||
|---|---|---|---|---|---|---|
|
|
|
| Y = g y mod n | X, g, n | |
|---|---|---|
| K = X y mod n | Y | |
| database with | personalization | |
| encrypted, card-specific | data in plaintext | |
| personalization data |
card number
KM
Figure 10.64 Schematic representation of a possible procedure for personalization using cryptograph-ically secured transmission of data and keys. In this special procedure, the keys for loading the data in encrypted form are negotiated in advance using a Diffie–Hellman key exchange. This eliminates the need to transmit a previously stored symmetric personalization key to the smart card in cleartext in a separate step. Only the cryptographically relevant processes are shown
correct sequence to the smart card and compares the responses received from the card with the responses accompanying the commands. If they do not match, the smart card is not behaving as expected and a personalization error must have occurred. With this method, it is not necessary to have a special security module for the tests in the personalization machine.
| 10.4 | 647 |
|---|
throughput
|
no printing |
|---|
50 cards/h
0 cards/h
| 0 kB | 2 kB | 4 kB | 6 kB | 8 kB | 10 kB | 12 kB | 14 kB | 16 kB | 18 kB | 20 kB |
|---|
