ADFGVX cipher: Difference between revisions

{{trans|Nim}}

 

 

F encrypt(plainText, polybius, key)

 

V plainText = decrypt(cipherText, polybius, key)

 

{{out}}

 

=={{header|F_Sharp|F#}}==

// ADFGVX cipher. Nigel Galloway: August 23rd., 2021

let polybus=let n=[|yield! {'A'..'Z'}; yield! {'0'..'9'}|] in MathNet.Numerics.Combinatorics.GeneratePermutation 36|>Array.map(fun g->n.[g]),[|'A';'D';'F';'G';'V';'X'|]

let encrypt,decrypt=ADFGVX polybus "nigel" //Using "nigel" as the key no hacker will guess that!

let n=encrypt "ATTACKAT1200AM" in printfn $"\nATTACKAT1200AM encrypted is %s{n} which decrypted is %s{decrypt n}"

{{out}}

<pre>

=={{header|Go}}==

{{trans|Wren}}

 

import (

plainText2 := decrypt(polybius, key, cipherText)

fmt.Println("\nDecrypted :", plainText2)

 

{{out}}

 

=={{header|J}}==

lenword=: {{ ;({~ ?@#)(#~ (-:~.)@>)(#~ y=#@>)cutLF fread'unixdict.txt'}}

ADFGVX=: {{ deb,' ',.n/:~|:(-#n)]\'ADFGVX'{~,($m)#:(,m)i.y([-.-.),m }}

 

roughcast

echo P=: polybius ''

FFF FGF FFF GXD XDG FDGG XDX XXA GAD

echo D=: P XVGFDA W E

 

That said, note that we could also eliminate spaces from the encrypted text, as they are recoverable if we have the key word.

 

 

echo S=: E-.' '

FFFFGFFFFGXDXDGFDGGXDXXXAGAD

P spaces W S

 

(Technically, we do not need the Polybius square to recover the spaces, but it's passed as an argument here for symmetry.)

 

=={{header|Julia}}==

The ADFGVX cipher.

See also eg. https://www.nku.edu/~christensen/092hnr304%20ADFGVX.pdf

println("Encoded: $encoded")

println("Decoded: $decoded")

<pre>

Polybius: L4VZJIB8OXGFM1H3CTNKU9PE75WQ2DAYRS06, Key: SUNFLOWER

It started as a translation, but actually we use a different method, better suited to Nim, to encrypt and decrypt. And there are many other differences. Output is similar though.

 

 

const Adfgvx = "ADFGVX"

 

let plainText = cipherText.decrypt(polybius, key)

 

{{out}}

 

=={{header|Perl}}==

 

use strict; # https://rosettacode.org/wiki/ADFGVX_cipher

}

 

{{out}}

<pre>

=={{header|Phix}}==

{{trans|Wren}} We can make some nice use of the standard builtin routines here, with only a modest amount of whitespace cleanup.

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">constant</span> <span style="color: #000000;">ADFGVX</span> <span style="color: #0000FF;">=</span> <span style="color: #008000;">"ADFGVX"</span><span style="color: #0000FF;">,</span>

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"\nPlainText : %s\n\nEncrypted : %s\n\nDecrypted : %s\n"</span><span style="color: #0000FF;">,</span>

<span style="color: #0000FF;">{</span><span style="color: #000000;">plaintext</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">encrypted</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">decrypted</span><span style="color: #0000FF;">})</span>

Output matches Wren/Nim/wp when the appropriate lines are uncommented.

 

According to historical sources the original encrypted text was spaced in 5 character blocks regardless

of message and key length, which means that decryption should not rely on spacing.

The ADFGVX cipher implemented as a Python class

See also eg. https://www.nku.edu/~christensen/092hnr304%20ADFGVX.pdf

print('Encoded: ', ENCODED)

print('Decoded: ', DECODED)

<pre>

Polybius: A9GKMF1DQRSBVX8Z0WTEJLOPY5U4CN2H76I3, key: volcanism

=={{header|Raku}}==

Slightly different results from every other entry so far. See discussion page for reasons. It is impossible to tell from casual observation which column comes first in the Raku example. In every other (so far), the sub group with 4 characters is the first column.

 

my @header = < A D F G V X >;

my @order = $key.comb.pairs.sort( *.value )».key.pairs.sort( *.value )».key;

%cypher{ ( grep { /\w/ }, flat [Z] @order.map( { |@text.batch($key-length)».[$_] } ) ).batch(2)».join }.join;

{{out}}

<pre style="line-height:1.2em;">Key: GHOSTLIKE

{{libheader|Wren-seq}}

{{libheader|Wren-str}}

import "/ioutil" for FileUtil

import "/seq" for Lst

System.print("\nEncrypted : %(cipherText)")

var plainText2 = decrypt.call(polybius, key, cipherText)

 

{{out}}

 

=={{header|REXX}}==

/* REXX */

cls

say t

return

{{out}}

<pre>