P versus NP Problem Solution

and the practical solution to Advanced Encryption Standard

Seun Adedokun
Abstract This electronic document is a live template. The
various components of your paper [title, text, heads, etc.] are
already defined on the style sheet, as illustrated by the portions
given in this document.

I. INTRODUCTION
This is manuscript 5 of my solution to the P versus NP
problem The algorithm described by Advanced Encryption
standard is a symmetric key algorithm which means the
same key is used for both encryption and decryption
I explain teh fact that the Seun Adedokun Polynomial
algorithm that i formulate is significantly better than the
advanced encryption standard based on my analysis on the
number of rounds operations and computational complexity
analysis
II. S EUN A DEDOKUN P OLYNOMIAL A LGORITHM
A. Advanced Encryption Standard
Advanced Encryption standard is based on a design
principle known as substitution permutation network the
advanced Encryption standard has a fixed block size of 128
bits and a key size of 128 192 or 256 bits
The advanced Encryption standard operate on a 4 by 4
column major order matrix of bytes
if there are 16 bytes x0 x1 x2 ...x15 these bytes can be
represented in the matrix form x0 x4 x8 x12
x1 x5 x9 x13
x2 x6 x10 x14
x3 x7 x11 x15
the key size of the advanced encryption standard cipher
specifies the number of rounds repetition that converts the
inputs called the plain text to output called the cipher text
the number of cycles of repetitions are as follows
10 cycles of repetition for a 128 bit key
12 cycle of repetition for a 192 bit key
14 cycle of repetition for a 256 bit key
The steps of the Advanced Encryption Standard are
Get some round keys for the Advanced Encryption standard
as a separate 128 bit round key block for each round
The initial round of the advanced encryption standard is
when each byte of the state is combined with a block of the
round key using bitwise xor
Rounds
Subbytes a non linear substitution step of the advanced
encryption standard where each byte is replaced with

another according to a lookup table

ShiftRows a transposition step where the last three rows of
the state are shifted cyclically a certain number of steps
Mixcolumns a mixing operation which operates on the
columns of the state combining the four bytes in each
column
Addroundkey Final round no mixcolumns Subbytes
shiftrows
addroundkeys
B. Steps of the Advanced Encryption Standard
The Subbyte step is a non linear substitution step where
each byte is replaced with another according to a look up
table this is shown in the first figure

The ShiftRow step is a step where bytes in each row of the

state are shifted cyclically to the left where the number of
places each byte is shifted differd for each row this is shown
in the second figure
The Mixcolumn step each column of the state is multiplied
by a polynomial c(x) this is shown in the third figure
The Addround step where each byte of the state is combined
with the byte of the round subkey using the XOR operation
C. why the the Seun Adedokun Polynomial Algorithm is
significantly better than the Advanced Encryption Standard
what is really important for the analysis is the number
of rounds the number of repetitions and the number of
operations in the encryption
I analyze the Key distinguishing attack on the Advanced
Encryption Standard and why the Seun Adedokun
Polynomial Algorithm is significantly better than the
Advanced Encryption standard the key distinguishing attack
on the advanced encryption standard works on the 128 bit
Advanced Encryption standard which is based on 10 rounds
but the attack on the advanced encryption standard is not
effective against the Advanced encryption standard
The 128 bit is of the exponential order O(27 ) therefore the
Seun Adedokun Polynomial algorithm that i formulate can
make the advanced encryption standard tractable since it
runs in a polynomial time of the order 7 which is faster
than the 10 rounds for the 128 bit
I analyze the key recovery attack on the Advanced Encryption standard and why the Seun Adedokun Polynomial
Algorithm is significantly better than the Advanced Encryption standard the key recovery attack on the advanced
encryption standard requires a 2126.2 operations to recover
an AES 128 key and requires 2192.6 operations for AES
192 and 2254.6 operations for AES 256 the Seun Adedokun
Polynomial Algorithm is significantly better since it does
126.2 operations to recover a AES 128 and it does 192.6
operations to recover AES 192 and it does 254.6 operations
to recover AES 256
III. CONCLUSIONS
This is manuscript 5 of my solution to the P versus NP
problem The algorithm described by Advanced Encryption
standard is a symmetric key algorithm which means the same
key is used for both encryption and decryption I explain teh
fact that the Seun Adedokun Polynomial algorithm that i
formulate is significantly better than the advanced encryption
standard based on my analysis on the number of rounds
operations and computational complexity analysis
I have shown that the Seun Adedokun Polynomial Algorithmm is significantly better than the advanced encryption
standard based on the fact that i explained a better cryptography analysis than the known key distinguishing attack on the
advanced encryption standard and the key recovery attack on
the advanced encryption standard
APPENDIX
Appendixes should appear before the acknowledgment.

ACKNOWLEDGMENT
The preferred spelling of the word acknowledgment in
America is without an e after the g. Avoid the stilted
expression, One of us (R. B. G.) thanks . . . Instead, try R. B.
G. thanks. Put sponsor acknowledgments in the unnumbered
footnote on the first page.
References are important to the reader; therefore, each
citation must be complete and correct. If at all possible,
references should be commonly available publications.
R EFERENCES
[1] question on the Boolean satisfiability criterion