Reverse Engineering RET Homepage RET Members Reverse Engineering Projects Reverse Engineering Papers Reversing Challenges Reverser Tools RET Re-Search Engine Reverse Engineering Forum Reverse Engineering Links

Go Back   Reverse Engineering Team Board > Reverse Engineering Board > Steganography + Cryptography
FAQ Members List Calendar Search Today's Posts Mark Forums Read

Reply
 
Thread Tools Display Modes
  #1  
Old 04-22-2005, 03:41 PM
groundhog groundhog is offline
Junior Member
 
Join Date: Apr 2005
Posts: 1
Default

I have encountered some difficulty in determing a general formula for finding the inverse of an invertible n by n square matrix modulo p, for anything other than the 2 by 2 case. I know the determinant and p must be relatively prime, but know of no resources which give the precise general formula. I'm interested in computing inverses (modulo a given number, say 26) for the 3 by 3, 4 by 4 and general cases. Also does anyone have info on computational complexity pertaining to the strengths/weaknesses of this particular encryption scheme? In particular, in comparision to the RSA cipher, does the effectiveness of this algebraic method to prevent against 'known-plaintext' and other forms of cryptanalys increase exponentially as the size of the matrix used in encryption increases? i.e. does the advantages of using an exponentially large matrix outweigh the disadvantages associated with computing decryption keys, ease of Alice & bob to communicate etc etc...
Reply With Quote
Reply


Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

vB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Forum Jump





Powered by vBulletin® Version 3.6.4
Copyright ©2000 - 2019, Jelsoft Enterprises Ltd.