oguzcrypto.ru


        

        

        

        
Key matrix (0–25 per cell)

        

        

        
Key matrix (4×4 bytes, hex 00–FF per cell)
Input block matrix (4×4 bytes, hex 00–FF per cell — first 16 bytes of plaintext)

        

        

        

        

Enter P and Q — everything else is computed: N = P × Q, φ(N) = (P−1)(Q−1), and D = E⁻¹ mod φ(N). You may supply a comma-separated list of candidates for P or Q; the first prime in each list is used (non-primes are skipped). If E is left blank, the smallest valid E (1 < E < φ, gcd(E, φ) = 1, E ∉ {P, Q}) is picked automatically. Letters: A=1, B=2, …, Z=26.


        

        

        

Given (public): p (prime), e1 (generator, 1 < e1 < p), and d (private key).
Auto-derived 3rd public key: e2 = e1^d mod p — shown live below.
Encrypt: C1 = e1^r mod p,  C2 = PT · e2^r mod p  |  Decrypt: s = C1^d mod p,  PT = C2 · s⁻¹ mod p.  Letters: A=1…Z=26.

e2 = e1^d mod p

        

SHA-256 is a one-way hash function — it produces a fixed 256-bit (64 hex char) digest. There is no key and no decryption.