Base Encryption: Dynamic algorithms, Keys, and Symbol Set
Po-Han Lin

TL;DR
Base Encryption introduces a novel encryption approach using dynamic algorithms, symbol remapping, and base conversion to overcome fixed symbol sets, key lengths, and static operations in traditional encryption methods.
Contribution
It presents a new encryption framework that employs dynamic operations and symbol remapping, enhancing security against common attack vectors.
Findings
Resistant to plain-text-attacks
Resistant to brute-force-attacks
Supports plug-and-play encryption modules
Abstract
All the current modern encryption algorithms utilize fixed symbols for plaintext and cyphertext. What I mean by fixed is that there is a set and limited number of symbols to represent the characters, numbers, and punctuations. In addition, they are usually the same (the plaintext symbols have the same and equivalent counterpart in the cyphertext symbols). Almost all the encryption algorithms rely on a predefined keyspace and length for the encryption/decription keys, and it is usually fixed (number of bits). In addition, the algorithms used by the encryptions are static. There is a predefined number of operatiors, and a predefined order (loops included) of operations. The algorithm stays the same, and the plaintext and cyphertext along with the key are churned through this cypherblock. Base Encryption does the opposite: It utilizes the novel concepts of base conversion, symbol…
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.
Taxonomy
TopicsArtificial Immune Systems Applications
