Sample code for 30+ languages & platforms
Zig Requires Chilkat v11.0.0+

Duplicate PHP RSA Encryption

See more RSA Examples

Demonstrates how to duplicate the following PHP function.

Chilkat Zig Downloads

Zig
const std = @import("std");
const chilkat = @import("chilkat");

pub fn main(init: std.process.Init) !void {
    const alloc = init.arena.allocator();

    // This example requires the Chilkat API to have been previously unlocked.
    // See Global Unlock Sample for sample code.

    // Duplicate the following PHP code:
    //
    //    public function encryptRSA($plainText,$rsaMOD,$pubKEY){
    //         $rsa  = new RSA();
    //         $rsa->setEncryptionMode(RSA::ENCRYPTION_PKCS1);
    //         $publicKey = [
    //             'e' => new BigInteger($pubKEY,16),
    //             'n' => new BigInteger($rsaMOD,16)
    //         ];
    //
    //         $rsa->loadKey($publicKey);
    //         $ciphertext = $rsa->encrypt($plainText);
    //         return bin2hex($ciphertext);
    //     }
    //
    //     $plainText="key=abcdefghijkmnopq&iv=abcdefghijkmnopq&h=12345678&s=12345678"
    //     $rsaMOD="F0946D8F05604809E24B8CFFD30349CEA9E5F4D320BFD9E9AA1B088863F02C43E7997D37A3E27B4F8F359F1744DB6B20A437067C0D325A80660D12FF56A57673"
    //     $pubKEY="010001"

    // We have the RSA modulus in hex
    const rsa_mod = "F0946D8F05604809E24B8CFFD30349CEA9E5F4D320BFD9E9AA1B088863F02C43E7997D37A3E27B4F8F359F1744DB6B20A437067C0D325A80660D12FF56A57673";

    // The RSA exponent in hex is "010001", which is 65537 in decimal.  It's typically the exponent that is always used.
    const rsa_exp = "010001";

    // Get the RSA modulus and exponent in base64.
    const bd_mod = try chilkat.BinData.init();
    defer bd_mod.deinit();
    const bd_exp = try chilkat.BinData.init();
    defer bd_exp.deinit();
    try bd_mod.appendEncoded(rsa_mod, "hex");
    try bd_exp.appendEncoded(rsa_exp, "hex");

    // Build the XML representation of the RSA public key
    const xml = try chilkat.Xml.init();
    defer xml.deinit();
    xml.setTag("RSAPublicKey");
    xml.updateChildContent("Modulus", try bd_mod.getEncoded(alloc, "base64"));
    xml.updateChildContent("Exponent", try bd_exp.getEncoded(alloc, "base64"));

    // Load the RSA public key into a Chilkat public key object.
    const pubkey = try chilkat.PublicKey.init();
    defer pubkey.deinit();
    try pubkey.loadFromString(try xml.getXml(alloc));

    // Setup the RSA object for encryption and do it..
    const rsa = try chilkat.Rsa.init();
    defer rsa.deinit();
    rsa.setVerboseLogging(true);
    try rsa.usePublicKey(pubkey);

    // Use PKCSv1.5 padding
    rsa.setPkcsPadding(true);

    // Encrypt and return the string as hex.
    rsa.setEncodingMode("hex");
    const plain_text = "key=abcdefghijkmnopq&iv=abcdefghijkmnopq&h=12345678&s=12345678";
    const cipher_text = rsa.encryptStringENC(alloc, plain_text, false) catch {
        std.debug.print("{s}\n", .{try rsa.getLastErrorText(alloc)});
        return;
    };

    // Note: The PKCSv1_5 padding incorporates random bytes.  Therefore, the RSA encryption will produce different results each time -- all of which are valid
    // and decrypt correctly to the same original text.
    std.debug.print("{s}\n", .{cipher_text});
}