Tool for decrypting / encoding with Phillips' cipher. Phillips cipher is a polyalphabetic code using 8 grids generated with one keyword.
Phillips Cipher  dCode
Tag(s) : PolyAlphabetic Cipher
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!
The Philips cipher is a polyalphabetic substitution cipher by blocks using 8 grids (1 initial grid and 7 others created from the first).
Philips Encryption uses an initial grid of 5x5 (or keyword to generate the grid).
Example: Basic Grid (with Z omitted)
\  1  2  3  4  5 

1  A  B  C  D  E 
2  F  G  H  I  J 
3  K  L  M  N  O 
4  P  Q  R  S  T 
5  U  V  W  X  Y 
The first step is to generate 7 other 5x5 grids of letters (to obtain 8 grids in total). The grid 1 is the initial grid, the grids 2, 3, 4 and 5 are obtained from the grid 1 by swapping line 1 with lines 2, 3, 4 and 5 respectively, and finally the grids 6, 7 and 8 are obtained from the grid 5 by switching line 1 with the line respectively 2, 3 and 4.
Example:
Grid 1
 Grid 2
 
Grid 3
 Grid 4
 
Grid 5
 Grid 6
 
Grid 7
 Grid 8

The Phillips cipher splits the text into blocks of size T characters (by default T=5 letters, in which case the blocks are called pentagrams). At the Nth block is associated the grid N (if there are more blocks than grids, the 9th block is again associated with grid 1, and so on).
Example: The message DCODEPHILLIPS is segmented DCODE,PHILL,IPS and DCODE is associated with grid 1, PHILL with grid 2 and IPS with grid 3.
Each letter of a block is then located in the associated grid, and corresponds to a letter encoded according to a shift on the grid of 1 downwards and 1 to the right (offset 1,1). (If this cell does not exist, it is necessary to imagine a continuity of the grid by its opposite side).
Example: D is encrypted by J in the grid
\  1  2  3  4  5 

1  A  B  C  D  ↴ 
2  F  G  H  ↳  J 
3  K  L  M  N  O 
4  P  Q  R  S  T 
5  U  V  W  X  Y 
The Phillips decryption is identical to the encryption, except for the shift in the grid which is reversed. Instead of moving one square to the right and one square down, the decryption performs the reverse path, moving one square to the left and one square to the top.
Example: J is decrypted by D in the grid
\  1  2  3  4  5 

1  A  B  C  D  ↰ 
2  F  G  H  ↖  J 
3  K  L  M  N  O 
4  P  Q  R  S  T 
5  U  V  W  X  Y 
The Phillips cipher can be assimilated to a polyalphabetic cipher, its coincidence index is low between 0.04 and 0.05.
Using a 5x5 grid means that the message consists of up to 25 distinct letters.
Any reference to a screwdriver (Philips is the name given to the cruciform screwdriver) is a clue.
Several variants are possible:
— An alternative method of generating the 8 grids, or even not limited to 8 grids.
— The shift of (+1, +1) can very well be modified by any pair (+n, +m)
The block size T may be different, or even vary according to a given split rule.
dCode retains ownership of the "Phillips Cipher" source code. Except explicit open source licence (indicated Creative Commons / free), the "Phillips Cipher" algorithm, the applet or snippet (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or the "Phillips Cipher" 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 "Phillips Cipher" are not public, same for offline use on PC, mobile, tablet, iPhone or Android app!
Reminder : dCode is free to use.
The copypaste of the page "Phillips Cipher" 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):
Phillips Cipher on dCode.fr [online website], retrieved on 20240718,