Anamorphic Cryptography using Baby-Step Giant-Step Recovery

TL;DR

This paper implements Anamorphic Cryptography with ECC, demonstrating improved performance and security features, including hiding messages in nonces and using Baby-step Giant-step for efficiency.

Contribution

It introduces an ECC-based implementation of Anamorphic Cryptography with optimized Baby-step Giant-step algorithm, enhancing security and performance over traditional discrete logarithm methods.

Findings

ECC implementation improves security for specific bit lengths

Baby-step Giant-step significantly outperforms unoptimized elliptic curve methods

Secret messages are hidden within encryption nonces

Abstract

In 2022, Persianom, Phan and Yung outlined the creation of Anamorphic Cryptography. With this, we can create a public key to encrypt data, and then have two secret keys. These secret keys are used to decrypt the cipher into different messages. So, one secret key is given to the Dictator (who must be able to decrypt all the messages), and the other is given to Alice. Alice can then decrypt the ciphertext to a secret message that the Dictator cannot see. This paper outlines the implementation of Anamorphic Cryptography using ECC (Elliptic Curve Cryptography), such as with the secp256k1 curve. This gives considerable performance improvements over discrete logarithm-based methods with regard to security for a particular bit length. Overall, it outlines how the secret message sent to Alice is hidden within the random nonce value, which is used within the encryption process, and which is cancelled out when the Dictator decrypts the ciphertext. It also shows that the BSGS (Baby-step Giant-step) variant significantly outperforms unoptimised elliptic curve methods.