Explore the cryptographic foundations and mathematical principles that power decentralized identity, secure communication, and trustless verification in emRA.ls.
🔐 Dive Into CryptographyemRA.ls leverages AES-256 for secure data encryption at rest. Every user's private key is encrypted with a password-derived key using PBKDF2-HMAC-SHA256.
AES-256 Encryption Formula (simplified):
C = Ek(P) ⊕ IV
where k ∈ 𝔽2256, P = plaintext, IV = initialization vector
Our ZKP system (based on zk-SNARKs) enables authentication without identity leakage. The protocol ensures:
If statement is true, verifier will be convinced
Prover cannot convince verifier of false statement
We utilize a modified Practical Byzantine Fault Tolerance (PBFT) protocol with threshold signature schemes for decentralized consensus.
Consensus Requirements:
Review the mathematical foundations, cryptographic libraries, and consensus algorithms we use to keep your data private and secure.
📚 View Full Specifications