Patent · US Expired

Optimization of a binary tree traversal with secure communications

US7195173B2 · kind B2 · utility

20Cited by
77References
35Claims
0Family size

Assignee

Inventors

Key dates

Filing dateOct 27, 2003
Grant dateMar 27, 2007
Priority date
Expiry dateMar 6, 2024

Classification

  • Technology area (CPC G)Physics
  • CPC primaryG06K7/0008
  • WIPO fieldComputer technology
  • WIPO sectorElectrical engineering

Abstract

Methods and systems for the negotiation of a population of RFID tags with improved security is provided. In one aspect, a binary traversal is performed to singulate tags without using information that directly identifies the tags in the tag population. A key is generated to identify each RFID tag of the population of RFID tags. The generated key does not include bits identifying an item with which the particular RFID tag is associated. A binary tree algorithm is operated to identify one or more tags in the population of RFIDs tags using the generated keys. In another aspect, frequency hopping and/or spread spectrum techniques are used to provide improved security while negotiating tags. In another aspect, the reader causes the tags to scroll series of bits back to the reader for each bit sent to the tags to provide improved security.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.