Security Analysis of the Distance Bounding Protocol Proposed by Jannati and Falahati
In this paper, the security of a distance bounding protocol is analyzed which has been recently proposed by Jannati and Falahati (so-called JF). We prove that an adversary can recover key bits of JF protocol with probability of “1” while the complexity of attack is “2n” runs of protocol. In addition...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Shahid Rajaee Teacher Training University
2014-07-01
|
| Series: | Journal of Electrical and Computer Engineering Innovations |
| Subjects: | |
| Online Access: | https://jecei.sru.ac.ir/article_246_559b64e57aa6fc3cbb4771f2643cf088.pdf |