MY-ASSIGNMENTEXPERT™可以为您提供 ics.uci.edu CS167 Cryptography密码学的代写代考和辅导服务！
CS167课程简介
Encryption is a very complicated process in general, but you can simplify it by:
encrypting each character in the file independently
using a bitwise operator or operators to scramble each character separately
store the password (encrypted!) in the output file so that it can be compared with the password typed on the command line for decryption.
make sure your encryption technique uses bitwise operators, and is reversible. i.e. there is a way of recovering the character from the encrypted form reliably for all possible characters (the ASCII set). A very easy technique is to use the complement operator ~.
don’t put the password in any shape or form in your source code – the user of the program should have complete responsibility for it.
File processing is chapter 11; the bitwise operators are section 10.9; handling command line arguments is section 14.4.
Prerequisites
Deliverables
The problem statement, description and TDSR design diagram.
The completed source code.
A sample input file and the same file after encryption and decryption. The listings should be identical. There is no need to show the encrypted file since it should bear no resemblance to the input and will probably contain non-printing characters anyway.ments, or any incorrect ones.
CS167 Cryptography HELP（EXAM HELP， ONLINE TUTOR）
The 4th century Indian text, Kama Sutra, proposes, among other things, a method for secret writing where each letter is paired with another and each occurrence of a letter in a document is replaced by its mate. For example, we could pair $(A, V),(B, N),(C, E),(D, F),(E, C),(F, D)$, and so on, so that every “A” is replaced by ” $\mathrm{V}$ ” and every ” $\mathrm{V}$ ” is replaced by “A”, every “B” is replaced by “N” and every “N” is replaced by “B”, etc.
a. Give an example encryption using a Kama Sutra cipher
a. An example encryption using a Kama Sutra cipher with the given pairings could be:
Plaintext: THIS IS A SECRET MESSAGE Key: (A,V), (B,N), (C,E), (D,F), (E,C), (F,D), (G,K), (H,P), (I,X), (J,Q), (K,G), (L,Z), (M,Y), (N,B), (O,U), (P,H), (Q,J), (R,S), (S,R), (T,W), (U,O), (V,A), (W,T), (X,I), (Y,M), (Z,L)
Ciphertext: TVRQ RQ V PJXGXP VRYYJB
How many possible keys are there for the Kama Sutra cipher?
b. There are 13! (13 factorial) possible keys for the Kama Sutra cipher, which is a very large number. This is because there are 13 letters in the English alphabet that can be paired with any of the other 12 letters, and the order in which the pairs are chosen matters.
MY-ASSIGNMENTEXPERT™可以为您提供UNIVERSITY OF ILLINOIS URBANA-CHAMPAIGN MATH2940 linear algebra线性代数课程的代写代考和辅导服务！ 请认准MY-ASSIGNMENTEXPERT™. MY-ASSIGNMENTEXPERT™为您的留学生涯保驾护航。
