{"id":54694,"date":"2021-09-30T15:44:25","date_gmt":"2021-09-30T15:44:25","guid":{"rendered":"https:\/\/papersspot.com\/blog\/2021\/09\/30\/vigenere-cipher-encryption-and-breaking-programming\/"},"modified":"2021-09-30T15:44:25","modified_gmt":"2021-09-30T15:44:25","slug":"vigenere-cipher-encryption-and-breaking-programming","status":"publish","type":"post","link":"https:\/\/papersspot.com\/blog\/2021\/09\/30\/vigenere-cipher-encryption-and-breaking-programming\/","title":{"rendered":"Vigenere Cipher Encryption and breaking programming"},"content":{"rendered":"<p>I meet the problem about encryption and decryption programming.can someone help me? it can use programming C,java,C ,haskell&#8230;. <br \/>Purpose of this exercise: construct a tool to work with a substitution cipher.<br \/> Write a program that, given a query consisting of multiple substitution cipher<br \/> encryption and decryption requests, consecutively applies them to a given plaintext\/ciphertext and outputs the final result. Each request has the following<br \/> structure:<br \/> (d | e) (mapping | shift)<br \/> Where mapping represents a permutation of the 26 character English alphabet,<br \/> and shift is a signed 4 byte integer (\u22122<br \/> 31 \u2264 shift \u2264 2<br \/> 31 \u2212 1). A decryption<br \/> request should revert the specified mapping or shift on the given text.<br \/> Note: an encryption with a shift divisible by 26 does not modify the text and<br \/> a shift equal to 3 is equivalent to the classical Caesar encryption. The correct<br \/> sequence for calling the substitution cipher is the following:<br \/> 1. Call the tool on the command line without arguments.<br \/> 1<br \/> 2. On the first stdin line, indicate the series of requests (following the above<br \/> structure), followed by the newline character.<br \/> 3. On the following lines, insert the text upon which the query will be applied.<br \/> The first request will use this text to produce the ciphertext\/plaintext<br \/> which will be in turn used by the second request, and so forth until the<br \/> last request.<br \/> As an example, the following string could be inserted on the first line of stdin:<br \/> d 5 e 12 d zyxwvutsrqponmlkjihgfedcba e 3 <\/p>\n","protected":false},"excerpt":{"rendered":"<p>I meet the problem about encryption and decryption programming.can someone help me? it can use programming C,java,C ,haskell&#8230;. Purpose of this exercise: construct a tool to work with a substitution cipher. Write a program that, given a query consisting of multiple substitution cipher encryption and decryption requests, consecutively applies them to a given plaintext\/ciphertext and [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[20],"class_list":["post-54694","post","type-post","status-publish","format-standard","hentry","category-research-paper-writing","tag-programming"],"_links":{"self":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts\/54694","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/comments?post=54694"}],"version-history":[{"count":0,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts\/54694\/revisions"}],"wp:attachment":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/media?parent=54694"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/categories?post=54694"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/tags?post=54694"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}