CRPTOGRAPHY AND N/W SECURITY
Thread Rating:
• 0 Vote(s) - 0 Average
• 1
• 2
• 3
• 4
• 5
 fintovadakkan Active In SP Posts: 1 Joined: Jan 2010 14-01-2010, 05:38 PM please send me details about this topic
 justlikeheaven Active In SP Posts: 247 Joined: Jan 2010 16-01-2010, 04:50 PM Cryptography and Network Security finite fields Finite fields are becoming increasingly important in cryptography. Several modern cryptographic algorithms rely on computations in various finite fields, among them are AES and elliptic curve cryptography. Here, AES uses arithmetic in the finite field GF(28). All encryption algorithms whether symmetric key or public-key encryption involve arithmetic operations on integers. If we decide to work on n-bit integers, for efficiency of storage we would like to be able to use all integers on n-bits. This in turn means we have to do operations on integers from 0 to 2^(n-1) . We need finite fields having p^n elements, with p a prime number. The concepts needed for the basic understanding of AES are: -Groups, rings, fields Group(G, Â¢,e): a set G with a binary operation Â¢and an element ebelongs to G satisfying the Associativity, Identity element, and inverse element laws -Divisors, modular arithmetic Ring(R,+,Â¢,0): a set R with two binary operations + and Â¢satisfying the commutative, associative and distributive laws. -Euclidâ„¢s algorithm Euclid's Algorithmto compute gcd(a,b) â€œEuclid(a,b) (assume b>0) is summarised as: If b=0 then return a Else return Euclid(b,a mod b) -Polynomial arithmetic Ordinary polnomial arithmetic include Adding/subtracting two polynomials which is done by adding/subtracting the corresponding coefficients -Multiplyingtwo polynomials which is done in the usual way, by multiplying all terms with each other -Division(not necessarily exact) of two polynomials can also be defined if the coefficients are in a field. Computational considerations In computer implementations of the above operations, Addition of polynomials becomes bitwise XOR of their n-bit representations and Multiplication is shift & XOR: example for GF(2^8) with m(x)=x8+x4+x3+x+1 (AES).   CRPTOGRAPHY AND Network SECURITY.pdf (Size: 322.66 KB / Downloads: 103) for more details, visit this thread also: topicideashow-to-Cryptography--5386 Use Search at http://topicideas.net/search.php wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion

## Important Note..!

If you are not satisfied with above reply ,..Please

# ASK HERE

So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page

Quick Reply
Message
Type your reply to this message here.

Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
 (case insensitive)

 Possibly Related Threads... Thread Author Replies Views Last Post Request for project ideas on Social Security and Social Welfare Data Mining Guest 1 100 11-03-2016, 02:28 PM Last Post: mkaasees Wireless Sensor Network Security model using Zero Knowledge Protocol Guest 1 1,008 28-02-2014, 01:40 AM Last Post: mspadmini19 Improving security and efficiency in attribute based data sharing Guest 3 1,692 10-01-2014, 12:49 PM Last Post: seminar project topic project and implimentation on hacking and security Guest 1 404 02-09-2013, 09:40 AM Last Post: study tips designing and implementation of pyroeelectric infrared sensor based security system Guest 0 316 29-08-2013, 12:41 PM Last Post: Guest it security honey pot Guest 0 267 23-08-2013, 04:11 PM Last Post: Guest ensuring data storage security in cloud computing madhuri.nallam1708 18 10,181 31-07-2013, 02:17 PM Last Post: study tips ELECTRONIC SECURITY SYSTEM FOR RAILWAY COMPARTMENT avesh.kakadiya@yahoo.com 4 769 26-07-2013, 11:29 AM Last Post: study tips wireless network security Guest 1 431 08-07-2013, 09:32 AM Last Post: study tips line man security system sauravkne 2 714 04-07-2013, 02:34 PM Last Post: study tips