Tool to decrypt/encrypt with circular bit shift, a function that shifts all bits of a binary value thanks to a rotation operation.
Circular Bit Shift - dCode
Tag(s) : Modern Cryptography
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!
Circular Bit Shift
Circular Bit Shift Decoder
Circular Bit Shift Encoder
Answers to Questions (FAQ)
How to encrypt using Circular Bit Shift cipher?
The Circular Bit Shift encryption uses data in binary format, such as the ASCII encoding.
Example: DCODE is coded in binary ASCII 01000100 01000011 01001111 01000100 01000101 or 44 43 44 45 4F in hexadecimal.
The encryption starts by cutting the binary data into blocks of size B bits (if B=8 then the shift is applied to each byte) and for each block, making it undergo a circular rotation of N bits (+1 = shift left, -1 = shift right).
Example: 01000100 shifted by N=-1 becomes 00100010 (the right bit is moved on the left).
The message DCODE split into 8bits blocks and shifted by N=-1 becomes 00100010 10100001 10100111 00100010 10100010 or 22 A1 A7 22 A2 in hexadecimal.
For a block size B, an offset of -X or B-X is identical (modulo B).
How to decrypt Circular Bit Shift cipher?
Decryption requires knowing the settings (block size and offset) used. It is identical to encryption except for the offset N which takes the opposite value (encryption with N = 1 is equivalent to decryption with N = -1).
Example: The binary message 00100010 10100001 10100111 00100010 10100010 encrypted with an offset of 1 bit.
00100010 is shifted by N=1 as 01000100 (the left bit is moved on the right).
The message becomes 01000100 01000011 01001111 01000100 01000101 that is ASCII values for DCODE.
How to recognize a Circular Bit Shift ciphertext?
The message is usually presented in a raw format or at best in hexadecimal or binary format, as the characters resulting from the processing are not always printable characters.
How to decipher Circular shifting without the shift?
Test all possible block sizes and offsets and keep those that show ASCII values of alphanumeric characters.
dCode attempts common sizes (binary numbers from 2 to 10 bits, multiples of 4 up to 40, multiples of 32 up to 128 bits) at all their shifts and displays most probable results.
Source code
dCode retains ownership of the "Circular Bit Shift" source code. Any algorithm for the "Circular Bit Shift" algorithm, applet or snippet or script (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or any "Circular Bit Shift" functions (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) or any database download or API access for "Circular Bit Shift" or any other element are not public (except explicit open source licence like Creative Commons). Same with the download for offline use on PC, mobile, tablet, iPhone or Android app.
Reminder: dCode is an educational and teaching resource, accessible online for free and for everyone.
Cite dCode
The content of the page "Circular Bit Shift" and its results may be freely copied and reused, including for commercial purposes, provided that dCode.fr is cited as the source.
Exporting the results is free and can be done simply by clicking on the export icons ⤓ (.csv or .txt format) or ⧉ (copy and paste).
To cite dCode.fr on another website, use the link:
In a scientific article or book, the recommended bibliographic citation is: Circular Bit Shift on dCode.fr [online website], retrieved on 2025-04-16,
