Encryption of Covert Information into Multiple Statistical Distributions
R. C. Venkatesan

TL;DR
This paper introduces a novel encryption method that embeds covert information into multiple statistical distributions using null space projections, leveraging the instability of the process for security.
Contribution
It presents a new encryption strategy based on unitary projections into null spaces of multiple distributions inferred via maximum entropy, with a self-consistent key derivation method.
Findings
Numerical simulations demonstrate effective covert information embedding.
The method achieves secure encryption leveraging the instability of the encoding process.
Applicable to both symmetric and asymmetric cryptography.
Abstract
A novel strategy to encrypt covert information (code) via unitary projections into the null spaces of ill-conditioned eigenstructures of multiple host statistical distributions, inferred from incomplete constraints, is presented. The host pdf's are inferred using the maximum entropy principle. The projection of the covert information is dependent upon the pdf's of the host statistical distributions. The security of the encryption/decryption strategy is based on the extreme instability of the encoding process. A self-consistent procedure to derive keys for both symmetric and asymmetric cryptography is presented. The advantages of using a multiple pdf model to achieve encryption of covert information are briefly highlighted. Numerical simulations exemplify the efficacy of the model.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
