The Mathematics of Authenticated Symmetric Encryption
Symmetric encryption secures sensitive data using a single shared secret key. Unlike older cryptographic primitives that only guarantee confidentiality, Galois/Counter Mode (AES-GCM) provides **Authenticated Encryption with Associated Data (AEAD)**. It mathematically ensures both confidentiality and cryptographic integrity.
1. Key Derivation via PBKDF2 with 100,000 Iterations
Human passphrases typically lack sufficient entropy for direct 256-bit keys. The engine derives an ephemeral symmetric key via Password-Based Key Derivation Function 2:
$$\text{Key} = \text{PBKDF2}(\text{Passphrase}, \text{Salt}_{16\text{B}}, 100000, \text{SHA-256}, 256\text{ bits})$$Computing 100,000 cryptographic hashing rounds creates a computational barrier that neutralizes high-speed GPU dictionary and rainbow table brute-force attacks.
2. Zero-Knowledge In-RAM Architecture
The native Web Crypto API (crypto.subtle) executes cryptographic operations in an isolated, sandboxed thread directly within device memory. Unencrypted plaintext and derivation salts are purged immediately upon tab close.
🛡️ Browser Privacy Scanner
Audit your Canvas, WebGL, and WebRTC runtime exposure with Privacy Exposure Scanner.
🔒 PDF Password Lock
Encrypt confidential PDF files client-side in RAM using PDF Password Studio.
Frequently Asked Questions
What happens if I lose or forget my passphrase?
Because this is zero-knowledge mathematical encryption without a central server or backdoor, lost passphrases cannot be recovered by anyone, including UtilyxHub.
Can someone tamper with or alter the encrypted message?
No. AES-GCM includes a 128-bit authentication tag. If even a single byte of the ciphertext payload is altered, decryption will fail and abort immediately.