
Applied Math Applied Math Forum 
 LinkBack  Thread Tools  Display Modes 
January 22nd, 2013, 04:53 AM  #1 
Newbie Joined: Jan 2013 Posts: 1 Thanks: 0  PohligHellman Cipher + Affine Hill Cipher, relatively simpl
Hi guys, How you all doing? Would be a great help if you could help me solve these equations. I guess more than the answers I need the process by which you get to them. Here are the questions:  1) The cryptotext 3276 is a result of the PohligHellman Cipher with p = 7823 and e = 3129. Find the Plaintext. Encryption algo: Ee(x) =xe (mod p) Decryption algo: Dd(y) = yd (mod p)  2) The Affine Hill Ciper has the encryption function E(x^1,...,x^m) = (x^1,...,x^m) A+(b^1,...,b^m) (mod 26) where A is invertible m x m matrix. Encrypt the message "tavern" using the encryption key m=2, A= (see matrix below) ( 4 11 3 19 ) and (b^1, b^2) = (13, 5). Check your result by decrypting.  Ok. That's it! Any and all help would be appreciated... Thankss 

Tags 
affine, cipher, hill, pohlighellman, simpl 
Search tags for this page 
Click on a term to search for related topics.

Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Multiplicative cipher  part 2  purecotton  Number Theory  1  May 28th, 2012 06:30 AM 
a multiplicative cipher  milly2012  Number Theory  7  May 28th, 2012 04:17 AM 
DiffieHellman  wannabe1  Number Theory  2  February 15th, 2012 09:40 PM 
Help !... Need probability formula for historic cipher  TheSwede  Advanced Statistics  2  August 1st, 2011 10:25 PM 
Affine transformation and RSA cipher  nooblet  Number Theory  3  March 12th, 2009 03:46 AM 