Draft:Linora Cipher Source: en.wikipedia.org/wiki/Draft:Linora_Cipher
Submission declined on 26 June 2025 by Rambley (talk).
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
|  |
Linora Cipher
[edit]The Linora Cipher is a symmetric neighbor-chain encryption algorithm developed by the cryptographic enthusiast modify[1] in 2025. It transforms alphabetic characters through modular arithmetic and chaining of differences between neighboring characters, resulting in ciphertext where each character depends on both the input and the immediately preceding character.
Overview
[edit]The Linora Cipher operates on lowercase alphabetic characters, mapping each letter to an integer value (a = 0 to z = 25). It uses a repeating numerical key and processes plaintext characters by computing modular differences relative to their neighbors. This chaining creates a dependency between consecutive characters, increasing diffusion and complicating frequency analysis.
Algorithm
[edit]Encryption
[edit]- Convert each character of the plaintext to its corresponding integer value.
- For the first character:
- Add the first key element to it modulo 26.
- For each subsequent character:
- Compute the difference between the current plaintext character and the previous plaintext character modulo 26.
- Multiply this difference by the corresponding key element (cycled through the key).
- Take the result modulo 26 to obtain the ciphertext character.
Decryption
[edit]- For the first character:
- Subtract the first key element from the ciphertext character modulo 26.
- For each subsequent character:
- Multiply the ciphertext character by the modular inverse of the corresponding key element modulo 26.
- Add this result to the previous plaintext character modulo 26 to recover the current plaintext character.
Example
[edit]Given a plaintext such as "hello" and a key such as [3, 5, 7], each character is encrypted by the above process. The chaining ensures that a change in any plaintext character affects all subsequent ciphertext characters.
Security Considerations
[edit]The Linora Cipher introduces a chaining mechanism similar to cipher block chaining (CBC) modes in block ciphers but operates at the character level. While the chaining improves resistance against simple frequency analysis, the cipher is not considered secure for high-stakes cryptographic applications without additional measures. It is primarily intended for educational, experimental, or lightweight obfuscation use cases.
Authorship and License
[edit]The Linora Cipher was created by modify in 2025. The author retains copyright but permits usage and adaptation with appropriate attribution.
See also
[edit]External links
[edit]- Linora Cipher repository – Reference implementation and documentation (if available).
Category:Cryptography Category:Symmetric-key algorithms Category:Stream ciphers Category:2025 introductions
- ^ The creator of the Linora Cipher
- in-depth (not just passing mentions about the subject)
- reliable
- secondary
- independent of the subject
Make sure you add references that meet these criteria before resubmitting. Learn about mistakes to avoid when addressing this issue. If no additional references exist, the subject is not suitable for Wikipedia.