SOFT VERIFICATION OF MESSAGE AUTHENTICATION CODES
Natasa S. Zivic · 2012
The subject of the paper is soft verification of message protected by symmetric cryptographic check values, i.e. Message Authentication Codes. Soft verification is introduced as an extension of hard or standard verification, which is usual today in cryptographic applications. Algorithm for iterative correction of messages protected by Message Authentication Codes is theoretically analyzed, using probability theory. Results of the analysis are used for defining the most important parameter for the correct work of the algorithm – a threshold value. Theoretical analysis is also used for comparison with results of simulations of the threshold value used in the algorithm for soft verification. Similar results of the comparison confirm the theoretical analysis. At the end of the paper simulation results and a considerable coding gain of corrected messages and their Message Authentication Codes is shown.