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...
Պահպանված է:
| Հիմնական հեղինակներ: | , , |
|---|---|
| Ձևաչափ: | Artigo |
| Լեզու: | Inglês |
| Հրապարակվել է: |
Shahid Rajaee Teacher Training University
2014-07-01
|
| Շարք: | Journal of Electrical and Computer Engineering Innovations |
| Խորագրեր: | |
| Առցանց հասանելիություն: | https://jecei.sru.ac.ir/article_246_559b64e57aa6fc3cbb4771f2643cf088.pdf |
| Ցուցիչներ: |
Չկան պիտակներ, Եղեք առաջինը, ով նշում է այս գրառումը!
|