Invariant-Based Cryptography

2025/05/08 by Semenov, Stanislav
Computer Science · #03F60 #94A60 #Chaos-based Image/Signal Encryption #Cryptographic Implementations and Security #Cryptography and Data Security #Cryptography and Security (cs.CR) #E.3 #F.4.1 #FOS: Computer and information sciences

paper · pdf · doi:10.48550/arxiv.2505.05653

openalex publication_date 2025/05/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We propose a new symmetric cryptographic scheme based on functional invariants defined over discrete oscillatory functions with hidden parameters. The scheme encodes a secret integer through a four-point algebraic identity preserved under controlled parameterization. Security arises not from algebraic inversion but from structural coherence: the transmitted values satisfy an invariant that is computationally hard to forge or invert without knowledge of the shared secret. We develop the full analytic and modular framework, prove exact identities, define index-recovery procedures, and analyze security assumptions, including oscillator construction, hash binding, and invertibility conditions. The result is a compact, self-verifying mechanism suitable for secure authentication, parameter exchange, and lightweight communication protocols.

Citations

• Invariant Bridges Between Four Successive Points: A New Tool for Data Coding

Related

• Invariant-Based Cryptography: Toward a General Framework
• Lack of Unique Factorization as a Tool in Block Cipher Cryptanalysis
• Constructive Non-Linear Polynomial Cryptanalysis of a Historical Block Cipher
• A New Key-Agreement-Protocol
• Public-key cryptosystem based on invariants of diagonalizable groups