RFID Mutual Authentication Protocols Using Key Exchange Based on Hash Functions

Jang, Seung-Jae; Jung, Young-Hoon; Min, So Yeon; Lee, Keun-Wang; Jun, Moon-Seog

doi:10.1007/978-3-642-27180-9_30

Cited by 3 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(1) Tag selects three coupons denoted by (r i , To enhance security and feasibility, we set m = 24, that is to say, tag stores 24 coupons. In this case, C m 3 = 2024 is very close to 2048 = 2 11 , so we use 2048 instead of C m 3 , with which the module-2048 computation is just simple shifting operation. The value greater than 2024 and less than 2048 after modular operation is dropped.…”

Section: Coupons Updating Algorithmmentioning

confidence: 99%

“…The value greater than 2024 and less than 2048 after modular operation is dropped. Then the realization of pseudorandom number generator can do as follows: randomly select two 11-bit odd numbers a and τ 0 in each pseudorandom period, the recursion formula is τ s+1 = τ s × a mod 2 11 . To enhance randomness, we can randomly select a switching point b in a period to directly switch to the next period where b can be a pseudorandom number greater than 1024.…”

Section: Coupons Updating Algorithmmentioning

confidence: 99%

“…Nowadays, most of the existing RFID authentication schemes are still based on symmetric cryptographic technologies, such as hash function , stream cipher algorithms , and block cipher algorithms . But the symmetric key management is not flexible and become increasingly inefficient with the increase of users, which seriously restricts the application scale of RFID and the style of providing service, especially in the applications of supporting multiple readers (for example, customer, business, and supervisory agency all have the need to access one tag).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Improvement and optimized implementation of cryptoGPS protocol for low‐cost radio‐frequency identification authentication

Dong

Ding

Wei

2014

Security Comm Networks

View full text Add to dashboard Cite

In radio‐frequency identification (RFID) authentication technology, the authentication schemes between reader and tag based on public‐key cryptography (PKC) are much better than those based on symmetric‐key cryptography in terms of expanding the scale of RFID applications and the style of providing service, while the limitation of resource consumption and computation capability of RFID tags makes it difficult to apply traditional PKC to RFID authentications. The cryptoGPS protocol based on PKC proposed by Mcloone and Robshaw suits low‐cost RFID system well, but it just achieves one‐way authentication, and the authentication times are very limited, which makes it vulnerable to coupons‐exhausted DoS attacks. To solve these problems, cryptoGPS protocol is greatly improved to realize the mutual authentication between RFID reader and the tag. In the improved protocol, a readers' public key distribution scheme is proposed to support the mutual authentication and a coupons updating algorithm is presented to resist the aforementioned DoS attack. Moreover, a modified Rabin encryption algorithm and a parameter generation method based on Low Hamming Weight technology are proposed to optimize the implementation of the proposed authentication protocol. And a feasible hardware structure of the protocol is also given. The protocol's simulation results show that the scheme just needs 3232 equivalent gates, and the maximum time of single step is 3.3 ms (500 k clock). The scheme is suitable for the low‐cost tags. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

Section: Coupons Updating Algorithmmentioning

confidence: 99%

Section: Coupons Updating Algorithmmentioning

confidence: 99%