HMAC-based one-time password

The HOTP algorithm provides a method of authentication by symmetric generation of human-readable passwords, or values, each used for only one authentication attempt. The one-time property leads directly from the single use of each counter value.

Parties intending to use HOTP must establish some {{vanchor|parameters}}; typically these are specified by the authenticator, and either accepted or not by the authenticated entity:

• A cryptographic hash method H (default is SHA-1)
• A secret key K, which is an arbitrary byte string and must remain private
• A counter C, which counts the number of iterations
• A HOTP value length d (6–10, default is 6, and 6–8 is recommended)

Both parties compute the HOTP value derived from the secret key K and the counter C. Then the authenticator checks its locally generated value against the value supplied by the authenticated.

The authenticator and the authenticated entity increment the counter C independently. Since the authenticated entity may increment the counter more than the authenticator, {{IETF RFC|4226}} recommends a resynchronization protocol. It proposes that the authenticator repeatedly try verification ahead of their counter through a window of size s. The authenticator's counter continues forward of the value at which verification succeeds, and requires no actions by the authenticated entity.

To protect against brute-force attacks targeting the small size of HOTP values, the RFC also recommends implementing persistent throttling of HOTP verification. This can be achieved by either locking out verification after a small number of failed attempts, or by linearly increasing the delay after each failed attempt.

6-digit codes are commonly provided by proprietary hardware tokens from a number of vendors informing the default value of d. Truncation extracts 31 bits or $\backslash log\_\{10\}(2^\{31\})\; \backslash approx\; 9.3$ decimal digits, meaning that d can be at most 10, with the 10th digit adding less variation, taking values of 0, 1, and 2 (i.e., 0.3 digits).

After verification, the authenticator can authenticate itself simply by generating the next HOTP value, returning it, and then the authenticated can generate their own HOTP value to verify it. Note that counters are guaranteed to be synchronised at this point in the process.

The HOTP value is the human-readable design output, a d-digit decimal number (without omission of leading 0s):

: HOTP value = HOTP(K, C) mod 10^d.

That is, the value is the d least significant base-10 digits of HOTP.

HOTP is a truncation of the HMAC of the counter C (under the key K and hash function H):

: HOTP(K, C) = truncate(HMAC{{sub|H}}(K, C)),

where the counter C must be used big-endian.

Truncation first takes the 4 least significant bits of the MAC and uses them as a byte offset i:

: truncate(MAC) = extract31(MAC, MAC[(19 × 8 + 4):(19 × 8 + 7)]),

where ":" is used to extract bits from a starting bit number up to and including an ending bit number, where these bit numbers are 0-origin. The use of "19" in the above formula relates to the size of the output from the hash function. With the default of SHA-1, the output is {{val|20|ul=bytes}}, and so the last byte is byte 19 (0-origin).

That index i is used to select 31 bits from MAC, starting at bit i × 8 + 1:

: extract31(MAC, i) = MAC[(i × 8 + 1):(i × 8 + 4 × 8 − 1)].

31 bits are a single bit short of a 4-byte word. Thus the value can be placed inside such a word without using the sign bit (the most significant bit). This is done to definitely avoid doing modular arithmetic on negative numbers, as this has many differing definitions and implementations.{{Cite journal | url=https://tools.ietf.org/html/rfc4226#section-5.3 | title=HOTP: An HMAC-Based One-Time Password Algorithm | first1=Hoornaert | last1=Frank | first2=Naccache | last2=David | first3=Bellare | last3=Mihir | first4=Ranen | last4=Ohad | website=tools.ietf.org | date=December 2005 | doi=10.17487/RFC4226 }}

Both hardware and software tokens are available from various vendors, for some of them see references below.

Software tokens are available for (nearly) all major mobile/smartphone platforms (J2ME,{{cite web | work = Data Security Systems Solutions | date = 2006-02-24 | title = DS3 Launches OathToken Midlet Application | url = http://ds3global.com/index.php/en/news-a-events/news/97-securing-data-delivery-hassle-free-/ | url-status = dead | archive-url = https://web.archive.org/web/20131229080741/http://ds3global.com/index.php/en/news-a-events/news/97-securing-data-delivery-hassle-free- | archive-date = 29 December 2013 }} Android,{{cite web | year = 2010 | title = StrongAuth | url = http://www.androidzoom.com/android_applications/tools/strongauth_bmeq.html | url-status = dead | archive-url = https://web.archive.org/web/20100518213222/http://www.androidzoom.com/android_applications/tools/strongauth_bmeq.html | archive-date = 2010-05-18 }} iPhone,{{cite web | work = Archie L. Cobbs | year = 2010 | first = Archie L. | last= Cobbs | title = OATH Token | url = http://code.google.com/p/oathtoken/ }} BlackBerry,{{cite web | work = ActivIdentity | year = 2010 | title = ActivIdentity Soft Tokens | url = http://www.actividentity.com/products/authenticationdevices/SoftTokens/ | url-status = dead | archive-url = https://web.archive.org/web/20100917040954/http://actividentity.com/products/authenticationdevices/SoftTokens/ | archive-date = 2010-09-17 }} Maemo,{{cite web | work = Sean Whitbeck | year = 2011 | first = Sean | last = Whitbeck | title = OTP Generator for N900 | url = http://maemo.org/packages/view/otp/ }} macOS,{{cite web | work = Feel Good Software | year = 2011 | title = SecuriToken | url = http://www.feelgoodsoftware.com/ | url-status = dead | archive-url = https://web.archive.org/web/20120425125135/http://www.feelgoodsoftware.com/ | archive-date = 2012-04-25 }} and Windows Mobile).

{{update-section|date=August 2023}}

Although the early reception from some of the computer press was negative during 2004 and 2005,{{cite web | work = Network World | date = 2004-12-06 | first = Dave | last = Kearns | title = Digging deeper into OATH doesn't look so good | url = https://www.networkworld.com/article/2327517/digging-deeper-into-oath-doesn-t-look-so-good.html }}{{cite web | work = Computerworld | date = 2005-03-21 | first = Mark | last = Willoughby | title = No agreement on Oath authentication | url = http://www.computerworld.com/s/article/99273/No_agreement_on_Oath_authentication | access-date = 2010-10-07 | archive-date = 2012-10-11 | archive-url = https://web.archive.org/web/20121011015244/http://www.computerworld.com/s/article/99273/No_agreement_on_Oath_authentication | url-status = dead }}{{cite web | work = Computerworld | first = Burt | last = Kaliski | date = 2005-05-19 | title = Algorithm agility and OATH | url = http://www.computerworld.com/s/article/101788/Algorithm_agility_and_OATH | access-date = 2010-10-07 | archive-date = 2012-10-11 | archive-url = https://web.archive.org/web/20121011015258/http://www.computerworld.com/s/article/101788/Algorithm_agility_and_OATH | url-status = dead }} after IETF adopted HOTP as {{IETF RFC|4226}} in December 2005, various vendors started to produce HOTP-compatible tokens and/or whole authentication solutions.

According to the article "Road Map: Replacing Passwords with OTP Authentication"{{cite web | work = Burton Group | year = 2010 | first = Mark | last = Diodati | title = Road Map: Replacing Passwords with OTP Authentication | url = http://www.burtongroup.com/Research/PublicDocument.aspx?cid=2107 | access-date = 2011-02-10 | archive-date = 2011-07-21 | archive-url = https://web.archive.org/web/20110721060420/http://www.burtongroup.com/Research/PublicDocument.aspx?cid=2107 | url-status = dead }} on strong authentication, published by Burton Group (a division of Gartner, Inc.) in 2010, "Gartner's expectation is that the hardware OTP form factor will continue to enjoy modest growth while smartphone OTPs will grow and become the default hardware platform over time."

• Initiative for Open Authentication
• S/KEY
• Time-based one-time password algorithm (TOTP)

{{refs}}

• [https://datatracker.ietf.org/doc/html/rfc4226 RFC 4226: HOTP: An HMAC-Based One-Time Password Algorithm]
• [https://datatracker.ietf.org/doc/html/rfc6238 RFC 6238: TOTP: Time-Based One-Time Password Algorithm]
• [https://datatracker.ietf.org/doc/html/rfc6287 RFC 6287: OCRA: OATH Challenge-Response Algorithm]
• [https://openauthentication.org/ Initiative For Open Authentication]
• [https://nbviewer.org/github/algorithmic-space/cryptoy/blob/master/rfc4226.ipynb Implementation of RFC 4226 - HOPT Algorithm]{{dead link|date=January 2025}} Step by step Python implementation in a Jupyter Notebook

Category:Internet protocols

Category:Cryptographic algorithms

Category:Computer access control protocols