Viewing Single Post From: Transposition Cipher Cracker (c++)

Viewing Single Post From: Transposition Cipher Cracker (c++)
Revelation	Jun 20 2009, 09:35 AM
Administrator Posts: 386 Group: Admin Member #1 Joined: August 23, 2005	Quote: I've always found using pointer arithmetic that way to be confusing - easy to get wrong, and hard to tell when you had. It is, that's why I wrote down the algorithm, so I will never forget it. Quote: There's no question, though, that it's hugely faster than reordering the characters. It is very fast Keylengths below 11 take 3 seconds to be cracked. The hardcoded ciphertext with keylength 11 takes 40 seconds to be cracked. I think a great timesaver in my code is the d array, which counts the rest of irregular columnar transpositions depending on the current permutation.
	RRRREJMEEEEEPVKLWENFNVJKEEEEEAOLKAFKLXCFZAASDJXZTTTTTTTLSIOWJXMOKLAFJNNKFNXN RAGRBAQEMHIGDJVDSEOXVIYCELFHWLELJFIENXLRATALSJFSLCYTKLASJDKMHGOVOKAJDNMNUITN RRRRLJVEEEEECLYVYHNVPFTAEEEEEMWLMEIRNGLARWJAKJDFLWNTIERJMIPQWOTZEOCXKNUBNXCN RJIRPOWEANFUSNCZVDVZNMSFEKLOEPZLDKDJWSAAAAAAAOERHJCTNCKFRIMVKSOFOMKMANREWNBN RZUDRGXEEEEENFQIDVLQNCKNEEEEEDGLLLLLLAWIOSNCDARLODMTOEJXMILDFJROTKJSDNLVCZNN

Transposition Cipher Cracker (c++) · General