Given a block of data, say
THE+ QU+ICK+ BR+OWN+ FO+X J+UMP+ED +OVE+R T+HE +LAZ+Y D+OG
Is there any method of encryption that will make the knowledge that the '+' character will always repeat every 4th character useless for cracking the key used to encrypt the data?
If there is, how does that encryption work, and why would a known signal not enable you to break the code?
Please assume that the use of '+' as a repeating signal is merely an example, and that the signal can be as large and complex (or small and simple) as needed to prevent an encryption system from making that signal useless.
What I'm ultimately trying to figure out here is "Can I arrange my data in such a way that it is impossible for a malicious actor to hold it for ransom using any modern or theoretical encryption system."
This means that I don't actually care about the key, and I can know from the beginning that I'm looking at ciphertext, not randomly generated data meant to obfuscate my decryption attempts.
It also means that I'm assuming my goal isn't to elegantly decode the data by guessing the key in one try, instead I simply want to transform a brute force key cracking attempt requiring 1,000,000+ years into an attempt that will require a few days at most.