Kasiski - Maple Help
For the best experience, we recommend viewing online help using Google Chrome or Microsoft Edge.
Our website is currently undergoing maintenance, which may result in occasional errors while browsing. We apologize for any inconvenience this may cause and are working swiftly to restore full functionality. Thank you for your patience.

Online Help

All Products    Maple    MapleSim


StringTools

  

Kasiski

  

compute the Kasiski test on a string

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

Kasiski( s )

Parameters

s

-

Maple string

Description

• 

The Kasiski(s) command computes the so-called Kasiski-test for the string s. This is defined to be the least common multiple of the lengths of repeated substrings of s.

• 

In elementary cryptanalysis, it is often used in conjunction with the index of coincidence to attempt to determine the number of alphabets used to encipher a plain text with a polyalphabetic substitution cipher.

• 

All of the StringTools package commands treat strings as (null-terminated) sequences of 8-bit (ASCII) characters.  Thus, there is no support for multibyte character encodings, such as unicode encodings.

Examples

withStringTools:

Kasiskiabcde

0

(1)

Kasiskiabcdeabcdabc

1

(2)

See Also

string

StringTools

StringTools[Decode]

StringTools[Encode]

StringTools[Entropy]

StringTools[IndexOfCoincidence]

 


Download Help Document