My Math Forum Pohlig-Hellman Cipher + Affine Hill Cipher, relatively simpl

 Applied Math Applied Math Forum

 January 22nd, 2013, 05:53 AM #1 Newbie   Joined: Jan 2013 Posts: 1 Thanks: 0 Pohlig-Hellman 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 Pohlig-Hellman 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

### how to solve pohlig hellman decryption

Click on a term to search for related topics.
 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post purecotton Number Theory 1 May 28th, 2012 07:30 AM milly2012 Number Theory 7 May 28th, 2012 05:17 AM wannabe1 Number Theory 2 February 15th, 2012 10:40 PM TheSwede Advanced Statistics 2 August 1st, 2011 11:25 PM nooblet Number Theory 3 March 12th, 2009 04:46 AM

 Contact - Home - Forums - Cryptocurrency Forum - Top