الفهرس 
Abstract
RFID SystemOnly 14 pages are availabe for public view
 |  | from | 159 |  |  |
| | | from | 159 | | |
Abstract
Radio-Frequency Identification (RFID) tags are poised to supplant barcodes in the very near future. Advantages of RFID tags over barcodes are many including their capacity to store more information, and the ease with which they can be read since they don’t require line of sight. The primary impediment to their widespread use is their cost. Privacy and security issues also play a major role in the success of RFID tag implementations due to the ease with which the object they are attached to can be identified and/or tracked by an adversary.
The RFID security problem, there are a lot of security protocols families solve it. One of these families is the Hopper and Blum (HB) family protocols. The HB family is Practicable and investigated. The HB family of protocols is the most commonly used in industry for passive RFID due to its simplicity. The security problem is particularly challenging because the RFID tags are limited in cryptographic functionality and general performance. The security the HB family protocols rely on the Learning from Parity with Noise problem (LPN). The LPN problem solved for finding the secret key of RFID tag and reader. Many algorithms proposed to solve the LPN problem such as Blum, Kalai, and Wasserman (BKW), Levieil and Fouque (LF1 and LF2), and Novel algorithms.
In this thesis two protocol categories (linear and nonlinear) are proposed to enhance the security of the HB family. First, linear category of protocols are proposed; the complement HB protocol (CHB) which uses the k-bit secret key and its complement as secret keys for the HB protocol, rotate HB protocol (RHB) which rotate the k-bit security key and used as secret keys for the HB protocol, rotate complement HB (RCHB) is a combination of CHB and RHB with its security key composed of three parts; the first is the complementation followed by rotation and the k-bit secret key of the HB protocol, and the partial complement HB (PCHB) which uses the k-bit secret key and its partial complement as secret keys for the HB protocol, protocols are variants of the HB protocol.
Second, the nonlinear category of protocols is proposed; Multi Non-Linear HB (MNLHB) protocol which added variable number of non-linear stages to the NLHB protocol. Two specific examples are proposed; the Double Non-Linear HB (DNHB) protocol and the Triple Non-Linear HB (TNLHB) protocol. Tables are given to show the level of securities achieved by the proposed protocols.
All the proposed protocols are implementation using VHDL and simulated using FPGA. Finally, a comparison is held for every one of the proposed protocols with the other HB protocols with respect to hardware implementation complexity in terms of the number of binary multiplication and addition made by the specific protocol.