Πώς λειτουργεί το TOTP: Υλοποίηση του αλγορίθμου RFC 6238 σε Python, JavaScript & Go

import base64
import hashlib
import hmac
import struct
import time
def generate_totp(secret_base32: str, timestamp: int = None, step: int = 30, digits: int = 6) -> str:
"""
Δημιουργία κωδικού TOTP συμβατού με το RFC 6238.
:param secret_base32: Κοινόχρηστο μυστικό κλειδί σε μορφή Base32 (π.χ. ‘JBSWY3DPEHPK3PXP’)
:param timestamp: Χρονική σήμανση εποχής Unix σε δευτερόλεπτα. Προεπιλογή σε time.time()
:param step: Παράθυρο χρονικού βήματος σε δευτερόλεπτα (προεπιλογή: 30)
:param digits: Αριθμός ψηφίων εξόδου (προεπιλογή: 6)
:return: Συμπληρωμένη με μηδενικά συμβολοσειρά OTP (π.χ. ‘045812’)
"""
if timestamp is None:
timestamp = int(time.time())
# 1. Κανονικοποίηση συμβολοσειράς Base32 και προσθήκη χαρακτήρων συμπλήρωσης '='
normalized_secret = secret_base32.replace(" ", "").upper()
padding_needed = (8 - len(normalized_secret) % 8) % 8
normalized_secret += "=" * padding_needed
key_bytes = base64.b32decode(normalized_secret)

# 2. Υπολογισμός 64-bit big-endian μετρητή χρονικού βήματος T
time_counter = timestamp // step
time_bytes = struct.pack(">Q", time_counter)  # 8 bytes big-endian unsigned long long

# 3. Υπολογισμός σύνοψης HMAC-SHA1 (20 bytes)
hmac_digest = hmac.new(key_bytes, time_bytes, hashlib.sha1).digest()

# 4. Εκτέλεση δυναμικής περικοπής (Dynamic Truncation)
offset = hmac_digest[-1] & 0x0F  # Χαμηλότερα 4 bits του 20ού byte
# Εξαγωγή 4 bytes στο offset και απαλοιφή του MSB sign bit
binary_code = struct.unpack(">I", hmac_digest[offset : offset + 4])[0] & 0x7FFFFFFF

# 5. Αριθμητική modulo και μορφοποίηση με συμπλήρωση μηδενικών
otp_code = binary_code % (10 ** digits)
return str(otp_code).zfill(digits)

if name == “main”:
test_secret = “JBSWY3DPEHPK3PXP”
print(f”Generated TOTP Code: {generate_totp(test_secret)}”)

const crypto = require('crypto');
// RFC 4648 Base32 Decoder in Pure JavaScript
function base32Decode(base32Str) {
const alphabet = ‘ABCDEFGHIJKLMNOPQRSTUVWXYZ234567’;
const cleaned = base32Str.replace(/=+$/, ”).toUpperCase().replace(/\s+/g, ”);
let bits = 0, value = 0, index = 0;
const output = new Uint8Array(Math.floor((cleaned.length * 5) / 8));
for (let i = 0; i < cleaned.length; i++) {
const val = alphabet.indexOf(cleaned[i]);
if (val === -1) continue;
value = (value << 5) | val;
bits += 5;
if (bits >= 8) {
output[index++] = (value >>> (bits - 8)) & 255;
bits -= 8;
}
}
return Buffer.from(output.buffer, 0, index);
}
function generateTOTP(secretBase32, timestamp = Math.floor(Date.now() / 1000), step = 30, digits = 6) {
const key = base32Decode(secretBase32);
const counter = Math.floor(timestamp / step);
// Allocate 8-byte buffer in Big-Endian format
const buffer = Buffer.alloc(8);
buffer.writeBigUInt64BE(BigInt(counter), 0);
// Compute HMAC-SHA1
const hmac = crypto.createHmac(‘sha1’, key).update(buffer).digest();
// Dynamic Truncation
const offset = hmac[hmac.length - 1] & 0x0f;
const binary = ((hmac[offset] & 0x7f) << 24) |
((hmac[offset + 1] & 0xff) << 16) |
((hmac[offset + 2] & 0xff) << 8) |
(hmac[offset + 3] & 0xff);
const otp = binary % (10 ** digits);
return otp.toString().padStart(digits, ‘0’);
}
console.log(“Calculated TOTP:”, generateTOTP(“JBSWY3DPEHPK3PXP”));

async function generateBrowserTOTP(secretBase32, timestamp = Math.floor(Date.now() / 1000)) {
  const keyBytes = base32Decode(secretBase32);
  const counter = Math.floor(timestamp / 30);
// 1. Import raw secret key into SubtleCrypto
const cryptoKey = await window.crypto.subtle.importKey(
“raw”,
keyBytes,
{ name: “HMAC”, hash: { name: “SHA-1” } },
false,
[“sign”]
);
// 2. Encode 8-byte Big-Endian counter buffer
const buffer = new ArrayBuffer(8);
const view = new DataView(buffer);
view.setBigUint64(0, BigInt(counter), false); // false = Big-Endian
// 3. Perform cryptographic HMAC sign
const signature = await window.crypto.subtle.sign(“HMAC”, cryptoKey, buffer);
const hmacResult = new Uint8Array(signature);
// 4. Dynamic Truncation
const offset = hmacResult[hmacResult.length - 1] & 0x0f;
const binary = ((hmacResult[offset] & 0x7f) << 24) |
((hmacResult[offset + 1] & 0xff) << 16) |
((hmacResult[offset + 2] & 0xff) << 8) |
(hmacResult[offset + 3] & 0xff);
const otp = binary % 1000000;
return otp.toString().padStart(6, ‘0’);
}

package main
import (
“crypto/hmac”
“crypto/sha1”
“encoding/base32”
“encoding/binary”
“fmt”
“math”
“strings”
“time”
)
// GenerateTOTP computes standard RFC 6238 time-based tokens
func GenerateTOTP(secretBase32 string, timestamp int64, step int64, digits int) (string, error) {
// 1. Sanitize Base32 seed and decode
cleaned := strings.ToUpper(strings.ReplaceAll(secretBase32, ” ”, ""))
key, err := base32.StdEncoding.WithPadding(base32.NoPadding).DecodeString(cleaned)
if err != nil {
key, err = base32.StdEncoding.DecodeString(cleaned)
if err != nil {
return "", err
}
}
// 2. Encode 64-bit Big-Endian time-step counter
counter := uint64(timestamp / step)
buf := make([]byte, 8)
binary.BigEndian.PutUint64(buf, counter)

// 3. Compute HMAC-SHA1
mac := hmac.New(sha1.New, key)
mac.Write(buf)
hash := mac.Sum(nil)

// 4. Dynamic Truncation
offset := hash[len(hash)-1] & 0x0f
binaryCode := binary.BigEndian.Uint32(hash[offset:offset+4]) & 0x7fffffff

// 5. Modulo arithmetic
mod := uint32(math.Pow10(digits))
otp := binaryCode % mod

format := fmt.Sprintf("%%0%dd", digits)
return fmt.Sprintf(format, otp), nil

}
func main() {
code, err := GenerateTOTP(“JBSWY3DPEHPK3PXP”, time.Now().Unix(), 30, 6)
if err != nil {
panic(err)
}
fmt.Printf(“Golang Computed TOTP: %s\n”, code)
}