北大考研复试上机——W's Cipher

最新推荐文章于 2021-05-31 21:43:16 发布

ujingzanghai

最新推荐文章于 2021-05-31 21:43:16 发布

阅读量442

点赞数

分类专栏： c/c++

本文链接：https://blog.csdn.net/ujingzanghai/article/details/79088616

版权

本文介绍了北大考研复试上机题目中涉及的W's Cipher解密算法。该算法要求对明文字符串进行分组凯撒加密，每组字符分别向前移动不同数量的位置。在解密时，需要逆转加密过程，通过映射字符位置和特定的循环右移操作来实现。难点在于处理超过字符串长度的密钥以及实现循环右移的操作。

摘要由CSDN通过智能技术生成

题目描述

Weird Wally's Wireless Widgets, Inc. manufactures an eclectic assortmentof small, wireless, network capable devices, ranging from dog collars,to pencils, to fishing bobbers. All these devices have very smallmemories. Encryption algorithms like Rijndael, the candidate for theAdvanced Encryption Standard (AES) are demonstrably secure but theydon't fit in such a tiny memory. In order to provide some security fortransmissions to and from the devices, WWWW uses the followingalgorithm, which you are to implement. Encrypting a message requiresthree integer keys, k1, k2, and k3. The letters [a-i] form one group,[j-r] a second group, and everything else ([s-z] and underscore) thethird group. Within each group the letters are rotated left by kipositions in the message. Each group is rotated independently of theother two. Decrypting the message means doing a right rotation by kipositions within each grou