usingMaths.com
From Theory to Practice - Math You Can Use.







<< PreviousNext >>

Dual Key Encryption in Java: A Guide to RSA Implementation



Dual Key Encryption in Java

Dual key encryption, also known as public/private key cryptography, is a core concept in modern data security. It is widely used in secure communications, digital certificates, and encrypted web applications. In this tutorial, you will learn how public and private key encryption works in Java, why it is classified as asymmetric encryption, and how dual keys are used to securely encrypt and decrypt data.

This explanation is designed for tertiary-level students and beginners who want a clear, practical understanding of cryptography concepts without unnecessary complexity.

What Is Dual Key (Public/Private Key) Encryption? | Explanation for Java Kids

Dual key encryption is an encryption method that uses two mathematically related keys:

  • A public key, which is shared openly and used to encrypt data
  • A private key, which is kept secret and used to decrypt data

This approach is formally known as public key cryptography or asymmetric encryption. Unlike symmetric encryption, where the same key is used for both encryption and decryption, dual key encryption ensures that encrypted data can only be decrypted by the intended recipient.

Why Asymmetric Encryption Is Important | Explanation for Java Kids

Asymmetric encryption solves a major problem in secure communication: key sharing. Since the public key can be distributed freely, there is no need to transmit a secret key over an insecure channel.

Key advantages include:

  • Improved security for data transmission
  • Safe communication over public networks
  • Strong authentication mechanisms
  • Foundation for HTTPS, SSL/TLS, and digital signatures

Because of these benefits, public/private key encryption is commonly used in web applications, secure messaging systems, and online banking platforms.


How Dual Key Encryption Works (Step by Step) | Explanation for Java Kids

The dual key encryption process follows a logical sequence:

  1. A key pair is generated (public key and private key)
  2. The sender encrypts data using the public key
  3. The encrypted message is transmitted
  4. The recipient decrypts the message using the private key

Only the matching private key can decrypt the data, even though the public key is visible to everyone. This is what makes asymmetric cryptography secure.

Java Example: Public and Private Key Encryption

In Java, asymmetric encryption can be implemented using cryptographic libraries or the Web Crypto API. The general workflow remains the same regardless of the specific implementation.

A typical Java public/private key encryption process includes:

  • Generating an RSA key pair
  • Encrypting data with the public key
  • Decrypting encrypted data with the private key

This approach allows Java applications to securely handle sensitive information such as passwords, tokens, and confidential messages.


The Mathematics of Public Key Encryption | Math Explanation for Java Kids

At its core, dual key encryption relies on the mathematical difficulty of factoring large numbers. Our Java RSA encryption tutorial focuses on the relationship between prime numbers and modular arithmetic. To generate a secure pair of keys, we follow a rigorous mathematical process:

  1. Prime Selection: Choosing two large prime numbers ( and ) to create a semi-prime modulus.
  2. LCM Calculation: Determining the Lowest Common Multiple of $(p-1)$ and $(q-1)$.
  3. Key Generation: Selecting a Public Key that is coprime to the LCM.
  4. The Inverse: Calculating the Private Key as the modular multiplicative inverse of the Public Key.
  5. Encrypt data: \([Unicode(data)]^{public\_key} % semi_prime = encoded_data;\)
  6. Decrypt data: \([encoded\_data]^{private\_key} % semi_prime = original data;\)

Implementing RSA Logic in Java

While many modern applications use the built-in WebCrypto API, writing a manual RSA implementation is the best way to grasp how ciphertext and plaintext interact.

Using Java's BigInteger capability, we can handle the large-scale integer calculations required for secure encryption. Below, we explore the Java code required to transform a standard Unicode string into an encrypted hexadecimal array, ensuring that only the holder of the private key can reverse the process.

Create a new Java class file;
Call it DualKeyEncryption.
Type out the adjoining Java code for encrypting and decrypting a chunk of data using a Public Key - Private Key pair.


By The Way: The encryption algorithm described in the above steps is called R.S.A. algorithm; and coming up with an algorithm that can factor very large semi primes into their prime factors in linear time is called the R.S.A. problem.

Also noteworthy is the fact that there are other ways of implementing an open-lock-only encryption algorithm; like the Logarithm Encryption, e.t.c.


Important: BigInteger is inbuilt in Java.
You only need to import the java.math.BigInteger library.

The Java algorithm class for finding LCM has been explained in the Primary Category.
Create a new Java class file called LCM in your current project and copy the L.C.M. code into it.


Why Use RSA in Java?

  • Educational Value: Great for learning cryptography concepts.
  • Practical Applications: Secure login systems, encrypted messaging, and digital signatures.
  • Flexibility: Java runs everywhere — windows, linux, and android.

Dual Key Encryption vs Symmetric Encryption | Explanation for Java Kids

It is important to distinguish between symmetric encryption and dual key encryption:

Symmetric vs Asymmetric Encryption Differences
FeatureSymmetric EncryptionDual Key Encryption
Number of keysOne shared keyTwo separate keys
SecurityLower for key exchangeHigher for communication
SpeedFasterSlower
Common useData storageSecure communication

In practice, many systems use both methods together, combining the speed of symmetric encryption with the security of asymmetric encryption.

Common Uses of Public/Private Key Cryptography | Explanation for Java Kids

Public and private key encryption is used in many real-world applications, including:

  • Secure web communication (HTTPS)
  • Digital certificates and authentication
  • Secure email systems
  • Encrypted file sharing
  • Secure API communication

Understanding dual key encryption in Java provides a strong foundation for learning advanced security and cryptography topics.


Key Takeaways from the Java Dual Key Encryption Algorithm

  • Dual key encryption uses a public key for encryption and a private key for decryption
  • It is also known as public/private key cryptography or asymmetric encryption
  • Java supports public key encryption through cryptographic APIs and libraries
  • This method is essential for secure communication on the web

Summary: Java Dual Key Encryption Algorithm

By understanding RSA encryption in Java, you gain insight into how modern cryptography protects sensitive information. Whether you're a student exploring modular arithmetic or a developer implementing public/private key cryptography, this tutorial provides the foundation you need.











Java Code for Dual Key Encryption - Class FIle

package miscellaneous;

import java.math.BigInteger;

public class DualKeyEncryption {

    BigInteger semi_prime;

    public DualKeyEncryption(BigInteger semi_prime) {
        this.semi_prime = semi_prime;
    }

    /*
     * STEP VI:
     */
    public String[] encodeWord(char[] msg, BigInteger key) {
        String[] encryption = new String[msg.length];
        int x;
        for (int i = 0; i < msg.length; i++) {
            // get unicode of this character as x
            x = (int) msg[i];
            // use RSA to encrypt & save in base 16
            encryption[i] = BigInteger.valueOf(x).modPow(key, semi_prime).toString(16);
        }

        return encryption;
    }

    /*
     * STEP VII:
     */
    public String decodeWord(String[] code, BigInteger key) {
        String decryption = "";
        int c;
        for (int i = 0; i < code.length; i++) {
            // use RSA to decrypt
            c = (new BigInteger(code[i], 16)).modPow(key, semi_prime).intValue();
            decryption += Character.toString((char) c);
        }

        return decryption;
    }
}


Java Code for Dual Key Encryption - Main Class

package miscellaneous;

import java.util.Arrays;
import java.util.List;
import java.math.BigInteger;

public class Miscellaneous {

    public static void main(String[] args) {
        /*
             * STEP I:
         */
        int p1 = 101; // 1st prime
        int p2 = 401; // 2nd prime
        /*
             * STEP II:
         */
        BigInteger semi_prime = BigInteger.valueOf(p1 * p2);

        /*
             * STEP III:
         */
        // get L.C.M. of p1-1 and p2-1
        List<Integer> stooge;
        stooge = Arrays.asList(p1 - 1, p2 - 1);
        LCM l_c_m = new LCM(stooge);
        int lcm = l_c_m.getLCM();

        /*
             * STEP IV:
         */
        // pick a random prime (public_key) that lies
        // between 1 and LCM but not a factor of LCM
        BigInteger public_key = BigInteger.valueOf(313);

        // find 'public_key' complement - private_key - such that
        // (public_key * private_key) % LCM = 1
        //this involves some measure of trial and error
        int i = 1;
        while ((lcm * i + 1) % public_key.intValue() != 0) {
            i++;
        }
        /*
             * STEP V:
         */
        BigInteger private_key = BigInteger.valueOf(i * lcm + 1).divide(public_key);

        char[] message = "merry xmas".toCharArray();
        DualKeyEncryption go_secure = new DualKeyEncryption(semi_prime);

        String[] encrypted = go_secure.encodeWord(message, public_key);
        System.out.println("Message is '" + String.valueOf(message) +
                "';\nEncrypted version is " + Arrays.toString(encrypted));

        String decrypted = go_secure.decodeWord(encrypted, private_key);
        System.out.println("\n\nDecrypted version is '" + decrypted + "'.");
    }

}






<< PreviousNext >>