eISSN: 2574-9927
Submit manuscript...
Review Article Volume 9 Issue 1
Numbering of anagrams and cryptography games
M Mestechkin
Received: April 18, 2025 | Published: July 14, 2025
Citation: Mestechkin M. Numbering of anagrams and cryptography games. Material Sci & Eng. 2025;9(1):27-34. DOI: 10.15406/mseij.2025.09.00252
Abstract
Three versions of numbering of n-block of plain text are proposed and a method how to restore the plane text from the given serial number in each case. These ciphering methods admit randomization of serial numbers reducing communication to the exchange of random numbers. Such procedure as is one-time pad approach does not include repetitions of serial numbers and looks satisfying Shannon’s criterion of an unbreakable code. The detail description is given of two mutually reciprocal algorithms computing the n-block serial number from the plain text (encoding) and restoring the plain text from the serial number with the removed random element (decoding). The recipient need only know how the random number is implemented in a block that serves as a secret key. Specific features of the algorithms within this general scheme: the “dictionary method” identifies a false cypher message in 99.95% of cases without decoding. The “anagram” method separates procedures for the letter contents of n-block and for the letter order. The simplest “division” method is the Euclidian algorithm adjusted for coding.
Keywords: anagram, positioning of integer among binomial coefficients, one-time pad, random number
©2025 Mestechkin. This is an open access article distributed under the terms of the, which permits unrestricted use, distribution, and build upon your work non-commercially.