| Summary: | 碩士 === 銘傳大學 === 資訊管理學系碩士班 === 102 === An RFID system is composed of a large number of tags, many readers and a back-end sever, where tags are attached to objects for authentication. With the advancement of wireless technology and the need for connecting objects, RFID systems are now widely used in the supply-chain management, inventory control, security control of many corporations as well as in other applications of many military and public facilities. In this thesis, we first discuss the authentication problem in the RFID system. Traditionally, the reader will read the tags and pass that information to the back-end serer for further processing. Unfortunately, the reader may loss contact with the server in certain environment, failing the authentication mechanism. On the other hand, a reader will need a memory space of n*(x+y) to authenticate tags independently, where n is the number of tags, x is the memory space of tag ID, and y is the memory space of key. A big n will overload the reader’s memory and thus, in the second step, we propose a new authentication mechanism to reduce the memory requirement. Thirdly, we improve the mechanism into a new one where a reader could use a hash function and a key to authenticate all tags. The reader needs a memory space of only one hash function and one key where the process involves only two hash computations in authenticating a tag. The authentication process is quick enough for RFID applications.
|
|---|
