StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POVigenere/Polyalphabetic Cipher Decoder/Decrypter/Breaker in Java
primarykey
Id
14076753
data
AcceptedAnswerId
14076876
AnswerCount
1
ClosedDate
CommentCount
6
CommunityOwnedDate
CreationDate
2012-12-28T22:48:18.810
FavoriteCount
0
LastActivityDate
2012-12-29T06:22:34.410
LastEditDate
2012-12-28T22:59:38.983
LastEditorUserId
1515685
OwnerUserId
1515685
ParentId
0
PostTypeId
1
Score
1
ViewCount
2213
LastEditorDisplayName
text
Body
I am trying to develop a program that encodes, decodes, and breaks the encryption for a message encoded with a Vigenere cipher. Where I am getting stuck is breaking [the encryption on] the message (without the key). I have an idea of how to go about doing it, but I'm not sure how to code it. My idea is a follows: The program would systematically generate potential keys, with a length starting at 1 and ending at 26. The keys would contain the letters of the English alphabet and are NOT case sensitive. For each key length (anywhere from 1-26), the key would be filled with the letter 'a', and then the program would check to see if they key was corrent (I have another method for that). If they key was incorrect, then the letter in the last position would be rotated to the next letter in the alphabet. Once the last letter had gone through all 26 possible positions, the second to last letter would be rotated, and then the last letter and the second to last letter would rotate accordingly, and so on a so forth (all the way back to the first letter of the [potential] key). Each time a new key is generated, the [potential] key is being checked with a separate method, and the method stops when the correct key is found. The key creation progression would go something like this: <pre><code>[starting with keys that are only 1 letter long] a b c ... x y z [now the potential key length becomes two] aa ab ac ad ... zw zx zy zz [eventually the potential key length becomes 26] aaaaaaaaaaaaaaaaaaaaaaaaaa aaaaaaaaaaaaaaaaaaaaaaaaab aaaaaaaaaaaaaaaaaaaaaaaaac aaaaaaaaaaaaaaaaaaaaaaaaad ... zzzzzzzzzzzzzzzzzzzzzzzzzw zzzzzzzzzzzzzzzzzzzzzzzzzx zzzzzzzzzzzzzzzzzzzzzzzzzy zzzzzzzzzzzzzzzzzzzzzzzzzz </code></pre> (hopefully you can see the pattern there) If anyone has or knows the code for how to do this, or could help guide met through the steps necessary to code this, it would be much appreciated. Thanks!
Tags
<java><encryption><vigenere>
Title
Vigenere/Polyalphabetic Cipher Decoder/Decrypter/Breaker in Java
singulars
PostAcceptedAnswerId
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. USiphonedev7
UserOwnerUserId
1. USiphonedev7
plurals
PostLinksPostIdRelatedPostId
1. PL
 singulars
 LinkTypeLinkTypeId
 LTLinked
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 POVigenere/Polyalphabetic Cipher Decoder/Decrypter/Breaker in Java
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.