Search for a tool
Chinese Code

Tool to decrypt/encrypt with Chinese code (also called Samurai code) using lines/sticks to encode letters.

Results

Chinese Code -

Tag(s) : Symbol Substitution

Share
Share
dCode and more

dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!
A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!


Please, check our dCode Discord community for help requests!
NB: for encrypted messages, test our automatic cipher identifier!


Feedback and suggestions are welcome so that dCode offers the best 'Chinese Code' tool for free! Thank you!

Chinese Code

Chinese Code Decoder (Image mode)

Chinese Code Decoder (Text mode)

 

Chinese Code Encoder

 




Answers to Questions (FAQ)

What is the Chinese Code? (Definition)

The Chinese code (or Samurai code) is a Scout code using intersecting vertical and horizontal lines to code letters according to the position of vowels and consonants in the alphabet.

How to encrypt using Chinese Code cipher?

Encryption with chinese code uses the positions (ranks) of vowels and consonants in the alphabet.

In the original chinese code cipher, the horizontal bars represent the vowels: A (1 bar), E (2 bars), I (3 bars), O (4 bars), U (5 bars), Y (6 bars) and vertical bars represent the number of consonants that follow the vowel in the alphabet.

Example: To code C, which is the 2nd consonant following the vowel A, use 1 horizontal bar (A is the first vowel) and 2 vertical bars.
To code L, which is the 3rd consonant following the vowel I, use 3 horizontal bars (I is the 3rd vowel) and 3 vertical bars.

Example: DCODE is written char(68)char(67)char(79)char(68)char(69)

The full original alphabet used is: code-chinois

There exists a variation which inverts the vertical and horizontal bars (also called the Samurai alphabet) code-samurai

How to decrypt Chinese Code cipher?

Count the number of horizontal and vertical lines. The number of horizontal lines represent the vowels: A, E, I, O, U, Y then the number of vertical lines is used for the number of consonants following the vowel.

The Samurai variant swaps the vertical and horizontal lines.

How to recognize Chinese Code ciphertext?

The ciphered message is made of horizontal and vertical bars/lines/sticks. It is often used by scouts.

References to China, Samurai, Bushis, or Mandarins are clues.

The principle is very similar to unary marks.

What are the variants of the Chinese Code cipher?

It is possible to switch vertical and horizontal lines in order that the represent consonants and vowels or the opposite.

Source code

dCode retains ownership of the "Chinese Code" source code. Except explicit open source licence (indicated Creative Commons / free), the "Chinese Code" algorithm, the applet or snippet (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or the "Chinese Code" functions (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) and all data download, script, or API access for "Chinese Code" are not public, same for offline use on PC, mobile, tablet, iPhone or Android app!
Reminder : dCode is free to use.

Cite dCode

The copy-paste of the page "Chinese Code" or any of its results, is allowed (even for commercial purposes) as long as you credit dCode!
Exporting results as a .csv or .txt file is free by clicking on the export icon
Cite as source (bibliography):
Chinese Code on dCode.fr [online website], retrieved on 2024-12-21, https://www.dcode.fr/chinese-code

Need Help ?

Please, check our dCode Discord community for help requests!
NB: for encrypted messages, test our automatic cipher identifier!

Questions / Comments

Feedback and suggestions are welcome so that dCode offers the best 'Chinese Code' tool for free! Thank you!


https://www.dcode.fr/chinese-code
© 2024 dCode — The ultimate 'toolkit' to solve every games / riddles / geocaching / CTF.
 
Feedback