|
|
|
|
CONTRIBUTORS:
|
|
|
CONFERENCE NAME:
|
|
|
CONF. LOCATION:
|
Kanyakumari
|
|
CONFERENCE YEAR:
|
2012
|
|
PUB TYPE:
|
Conference Presentation
|
|
SUBJECT(S):
|
Cryptography , Breaking AES
|
|
DISCIPLINE:
|
Computer Science
|
|
HTTP:
|
http://www.icect.org
|
|
LANGUAGE:
|
English
|
|
PUB ID:
|
103-501-504
(Last edited on
2012/04/01 09:51:57 GMT-6)
|
|
SPONSOR(S):
|
|
|
ABSTRACT:
Advance Encryption Standard (AES); a symmetric key encryption algorithm, is used worldwide. It has three variants, 128, 192 and 256 which differ in key size and in their number of rounds. It is supposedly the best known cipher and the present attacks have complexity of order 2119 or more. These attacks seem to pose no real threats. The work proposed dwells upon the credibility of Genetic Algorithms (GA) in searching techniques, to find out the key from the encrypted text. The work also relies on the belief that some words and alphabets are used more often than others. The combination of the above two theories along with some mathematical ingratiation can lead to breaking of AES with much lower complexity than the present algorithms.
|
|
|
|
STATISTICS
|
|
Click on # to view
|
|
Citations
|
|
0
|
|
References
|
|
0
|
|
Comments
|
|
0
|
|
Quality
|
|
1/6.00
|
|
Interest
|
|
1/5.00
|
|
View(er)s
|
|
2/105
|
|
|
|
|
|
|
| Prev |
Next |
|
