EMV Cards Vulnerabilities Detection Using Deterministic Finite Automaton

• Published in: Procedia computer science Vol. 127; pp. 531 - 538
• Main Authors: Hajji, Tarik, Ouerdi, Noura, Azizi, Abdelmalek, Azizi, Mostafa
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 2018
• Subjects: Deterministic Finite Automaton; EMV cards; transition state graph; vulnerabilities detection algorithm; Deterministic Finite Automaton; EMV cards; transition state graph; vulnerabilities detection algorithm
• ISSN: 1877-0509; 1877-0509
• DOI: 10.1016/j.procs.2018.01.152

Europay-MasterCard-Visa (EMV) standard aims to improve the security and reliability of smartcards. The main concern of this contribution is to detect vulnerabilities in an EMV transaction between terminal and EMV card. In this paper, we propose a new methodology for vulnerabilities detection based on Deterministic finite automaton (DFA). In fact, we use, as a starting point, the machine state diagram which models the specifications of a secure transaction between a terminal and a payment card. Then, we provide the DFA based on this transition state graph. We also provide the implementation of our DFA in order to recognize valid and invalid patterns automatically. Our tests proved the efficiency of our algorithm and its ability to recognize the vulnerabilities in terms of sequence of orders sent by the terminal to the EMV card.