×

Fast ciphering key search for WLAN receivers

  • US 8,811,618 B2
  • Filed: 07/26/2004
  • Issued: 08/19/2014
  • Est. Priority Date: 01/30/2004
  • Status: Active Grant
First Claim
Patent Images

1. A WLAN (Wireless Local Area Network) receiver comprising:

  • a ciphering key management circuit configured to control use of cipher keys for decrypting received data, wherein said ciphering key management circuit comprises a memory circuit configured to store a hash table having a first and a second set of entries, said first set of entries including transmitter address data comprised of a predetermined number of lower bits of a respective transmitter address, said second set of entries including at least one cipher key, wherein said ciphering key management circuit is configured to determine whether a transmitter address obtained from an incoming data frame matches said transmitter address data in said first set of entries, and if so, determine a cipher key corresponding to the transmitter address, wherein the cipher key is included in said second set of entries and is configured for use in decrypting said received data;

    wherein said transmitter address data included in said first set of entries is comprised of a number of lower bits of a respective transmitter address, wherein said first set of entries comprises a number of sub-fields, each configured to store transmitter address data of a different transmitter, wherein the ciphering key management circuit is configured to dynamically change the number of sub-fields by executing software instructions, and wherein said ciphering key management circuit is configured to reduce said number of lower bits responsive to an increase in said number of sub-fields;

    wherein said second set of entries comprises a number of table entries each configured to store at least one cipher key pertaining to a different transmitter, wherein each table entry has a fixed length independent from the length of the hash table;

    wherein the length of the hash table is given by the length of said first set of entries and the length of said second set of entries, said length of said second set of entries being dependent on said fixed length of said table entries and the number of table entries in said second set of entries, wherein the number of active sub-fields in said first set of entries is equal to the number of table entries in said second set of entries.

View all claims
  • 6 Assignments
Timeline View
Assignment View
    ×
    ×