Time-based One-time Password Algorithm

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Time-based One-time Password Algorithm (TOTP) is an algorithm that computes a one-time password from a shared secret key and the current time. It has been adopted as Internet Engineering Task Force standard RFC 6238,[1] is the cornerstone of Initiative For Open Authentication (OATH) and is used in a number of two factor authentication systems.

TOTP is an example of a hash-based message authentication code (HMAC). It combines a secret key with the current timestamp using a cryptographic hash function to generate a one-time password. The timestamp typically increases in 30-second intervals, so passwords generated close together in time from the same secret key will be equal.

In a typical two-factor authentication application, user authentication proceeds as follows: a user will enter username and password into a website or other server, generate a one-time password for the server using TOTP running locally on a smartphone or other device, and type that password into the server as well. The server will then also run TOTP to verify the entered one-time password. For this to work, the clocks of the user's device and the server need to be roughly synchronized (the server will typically accept one-time passwords generated from timestamps that differ by ±1 from the client's timestamp). A single secret key, to be used for all subsequent authentication sessions, must have been shared between the server and the user's device over a secure channel ahead of time. If some more steps are carried out, the user can also authenticate the server using TOTP.

Definition[edit]

TOTP is based on HOTP with a timestamp replacing the incrementing counter.

The current timestamp is turned into an integer time-counter (TC) by defining the start of an epoch (T0) and counting in units of a time step (TS). For example:

TC = (unixtime(now) - unixtime(T0)) / TS
TOTP = HOTP(SecretKey, TC), where the HOTP algorithm is defined below.
TOTP-Value = TOTP mod 10d, where d is the desired number of digits of the one-time password.

Let:

  • K be a secret key
  • C be a counter
  • HMAC(K,C) = SHA1(K ⊕ 0x5c5c... ∥ SHA1(K ⊕ 0x3636... ∥ C)) be an HMAC calculated with the SHA-1 cryptographic hash algorithm
  • Truncate be a function that selects 4 bytes from the result of the HMAC in a defined manner

Then we define

HOTP(K,C) = Truncate(HMAC(K,C)) & 0x7FFFFFFF

The mask sets the most significant bit to 0, to prevent the number from being interpreted as negative. This guards against different implementations of the modulo operation by processors.[2]

Implementation[edit]

According to RFC 6238, the reference implementation is as follows:

  • Generate a key, K, which is an arbitrary bytestring, and share it securely with the client.
  • Agree upon an epoch, T0, and an interval, TI, which will be used to calculate the value of the counter C (defaults are the Unix epoch as T0 and 30 seconds as TI)
  • Agree upon a cryptographic hash method (default is SHA-1)
  • Agree upon a token length, N (default is 6)

Although RFC 6238 allows different parameters to be used, the Google implementation of the authenticator app does not support T0, TI values, hash methods and token lengths different from the default. It also expects the K secret key to be entered (or supplied in a QR code) in base-32 encoding according to RFC 3548.[3]

Once the parameters are agreed upon, token generation is as follows:

  1. Calculate C as the number of times TI has elapsed after T0.
  2. Compute the HMAC hash H with C as the message and K as the key (the HMAC algorithm is defined in the previous section, but also most cryptographical libraries support it). K should be passed as it is, C should be passed as a raw 64-bit unsigned integer.
  3. Take the least 4 significant bits of H and use it as an offset, O.
  4. Take 4 bytes from H starting at O bytes MSB, discard the most significant bit and store the rest as an (unsigned) 32-bit integer, I.
  5. The token is the lowest N digits of I in base 10. If the result has fewer digits than N, pad it with zeroes from the left.

Both the server and the client compute the token, then the server checks if the token supplied by the client matches the locally generated token. Some servers allow codes that should have been generated before or after the current time in order to account for slight clock skews, network latencies and user delays.

History[edit]

A TOTP draft was developed through the collaboration of several OATH members in order to create an industry-backed standard. It complements the event-based one-time standard HOTP and offers end user organizations and enterprises more choice in selecting technologies that best fit their application requirements and security guidelines. In 2008, OATH submitted a draft version of the specification to the IETF. This version incorporates all the feedback and commentary that the authors received from the technical community based on the prior versions submitted to the IETF.[4] In May, 2011, TOTP officially became RFC 6238.[1]

Server implementations[edit]

  • Microsoft has implemented TOTP in its "two-step verification".[5]
  • Salesforce has implemented TOTP for account access and for step-up authentication when accessing parts of the application that requires high level security session.
  • Google has implemented TOTP in its Google Authenticator which is the basis of its two-factor authentication.[6]
  • Facebook uses TOTP for its "Login approval" and "Code generator".[7]
  • Amazon Web Services also supports TOTP for AWS console logins using Amazon Virtual MFA or Google Authenticator.[8]
  • Dropbox,[9] Evernote[citation needed], Gandi,[10] GitHub,[11] LastPass,[12] Linode,[13] and WordPress[14] have enabled the technology for account access.
  • Hover has enabled the technology for account access.[15]
  • LinOTP is open source and supports various TOTP and HOTP client authenticators
  • TOTP is a minimal open source TOTP implementation in PHP, with support for various authenticators including Google Authenticator
  • OpenAM is an open source Java based Single Sign On server that supports various TOTP and HOTP client authenticators
  • multiOTP is an opensource PHP implementation for HOTP, TOTP, mOTP and other tokens. It can be used as a command line tool, integrated in a web site, as a web service, as a radius plugin, etc.
  • privacyIDEA is an authentication backend that supports HOTP, TOTP, OCRA, mOTP and other token types like ssh public keys.
  • XenForo has an add-on to enable the technology for account access.[16]
  • CMO COMPLIANCE a Health, Safety & Environment Software Solution has implemented TOTP for account access authentication.

Client implementations[edit]

References[edit]

  1. ^ a b "RFC 6238 - TOTP: Time-Based One-Time Password Algorithm". Retrieved July 13, 2011. 
  2. ^ "RFC 4226 - HOTP: An HMAC-Based One-Time Password Algorithm". Retrieved Oct 20, 2014. 
  3. ^ "KeyUriFormat". Retrieved 5 August 2014. 
  4. ^ Alexander, Madison. "OATH Submits TOTP: Time-Based One Time Password Specification to IETF". Open Authentication. Retrieved 22 February 2010. 
  5. ^ "Microsoft Account Gets More Secure". The Official Microsoft Blog. Retrieved 17 April 2013. 
  6. ^ "google-authenticator – Project Hosting on Google Code". Retrieved 22 February 2010. 
  7. ^ "Extra security feature". Retrieved 30 January 2014. 
  8. ^ "AWS Multi-Factor Authentication". Retrieved 6 March 2012. 
  9. ^ "Another layer of security for your Dropbox account". Retrieved 4 May 2013. 
  10. ^ "Gandi rolls out two-factor authentication". Retrieved 21 November 2013. 
  11. ^ "About Two-Factor Authentication". Retrieved 4 September 2013. 
  12. ^ "Introducing Support for Google Authenticator". Retrieved 4 November 2011. 
  13. ^ "Linode Manager Two-Step Authentication". Retrieved 2 May 2013. 
  14. ^ "Two Step Authentication". WordPress. Retrieved 29 January 2014. 
  15. ^ "Two-step Signin is Here". Retrieved 25 February 2014. 
  16. ^ "[FreddysHouse] Two-factor Authentication". FreddysHouse. Retrieved 10 February 2014. 

External links[edit]