Method for cryptographic authentication
First Claim
Patent Images
1. A method for cryptographic authentication in an access security system, the method comprising:
- incrementing consecutive counts in segments of an Electrically Erasable Programmable Read-Only Memory (EEPROM) by;
retrieving an invalid count in one of three EEPROM segments;
detecting a maximum valid count from two remaining valid counts if an invalid count exists;
overwriting the invalid count with the maximum valid count;
when no invalid count exists, detecting a smallest valid count from three valid counts, wherein detecting the smallest valid count follows the retrieving step;
detecting a largest valid count from the three valid counts; and
overwriting the smallest valid count with the largest valid count, wherein the cryptographic authentication occurs after each successful execution of the incrementing step; and
after each incrementation, updating a current count in not more than one EEPROM segment to produce an updated counter value; and
using each updated counter value as a changing initialization value in subsequent cryptographic authentications.
10 Assignments
0 Petitions
Accused Products
Abstract
The invention relates to a method for cryptographic authentication in access security systems. The aim of the invention is to provide a software solution. To this end, the method for secured storage of counter states in a non-volatile memory (EEPROM) (10) involves an incrementing (11) process, and the current counter state is updated in only one EEPROM segment following each incrementing process (11), a subsequent access to the EEPROM (10) only being enabled in the event of a successful incrementing (11) of an EEPROM-based counter.
8 Citations
11 Claims
-
1. A method for cryptographic authentication in an access security system, the method comprising:
-
incrementing consecutive counts in segments of an Electrically Erasable Programmable Read-Only Memory (EEPROM) by; retrieving an invalid count in one of three EEPROM segments; detecting a maximum valid count from two remaining valid counts if an invalid count exists; overwriting the invalid count with the maximum valid count; when no invalid count exists, detecting a smallest valid count from three valid counts, wherein detecting the smallest valid count follows the retrieving step; detecting a largest valid count from the three valid counts; and overwriting the smallest valid count with the largest valid count, wherein the cryptographic authentication occurs after each successful execution of the incrementing step; and after each incrementation, updating a current count in not more than one EEPROM segment to produce an updated counter value; and using each updated counter value as a changing initialization value in subsequent cryptographic authentications. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
Specification