P versus NP Problem Solution

and the practical solution to Public Key cryptography

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 4 of my solution of the P versus NP
problem I explain the Seun Adedokun Polynomial Algorithm
and the practical consequence to public key cryptography
I explain the Seun Adedokun Polynomial Algorithm that i
formulate and that the Seun Adedokun Polynomial algorithm
is significantly better than the Public key Cryptography
I explain the Seun Adedokun Polynomial Algorithm that i
formulate and that the Seun Adedokun Polynomial algorithm
is significantly better than the RSA Encryption Algorithm
I explain the Seun Adedokun Polynomial Algorithm that i
formulate and that the Seun Adedokun Polynomial algorithm
is significantly better than the Digital Signature Algorithm
I explain the Seun Adedokun Polynomial Algorithm that i
formulate and that the Seun Adedokun Polynomial Algorithm is significantly better than the Pallier cryptosystem
I explain the Seun Adedokun Polynomial Algorithm that i
formulate and that the Seun Adedokun Polynomial Algorithm is significantly better than the Cramer shoup cryptosystem
I explain the Seun Adedokun polynomial algorithm that i
formulate and that the Seun Adedokun Polynomial Algorithm is significantly better than protocols using asymmetric
key algorithms like S/MIME GPP PGP ZRTP Secure VOIP
Protocol secure Socket Layer SILC SSH
II. S EUN A DEDOKUN P OLYNOMIAL A LGORITHM
A. Public Key Cryptography
Public Key cryptography is based on a pair of public and
private key s where the public keys may be disseminated
but teh private keys is known to the owner the public
key cryptography accomplishes two functions which are
authentication and encryption
A representation of the public key cryptography is shown
For the analysis of the figure where there is communication between alice and bob and there is a private and public
key
Bob can receive a message from Alice where the message
can be encrypted based on the public key of bob and the
message can be decrypted based on the private key of bob
The strength of the public key cryptography is based on
the degree of difficulty which is the level of computational

complexity for a generated private key to be determined from

the corresponding public key
The consequence of my formulation of the Solution to the
P Versus NP problem is that i break existing public key
cryptography by showing that my Seun Adedokun Polynomial Algorithm is significantly better and i replace the
cryptosystem with informational theoretical secure solution
The Seun Adedokun Polynomial time Algorithm that i formulate runs in polynomila time of order O(n) which makes
it significantly better than some other algorithms that runs in
the order O(2n )

B. RSA Cryptography
I explain the Seun Adedokun Polynomial Algorithm that i
formulate and the fact that it is significantly better than RSA
Cryptography
it is observed that in the formulation i expained as regards
the dpll algorithm the dpll algorithm requires 11 steps for the
implication graph which is about O(23 .5) therefore n=3.5
and it is observed that the Seun Adedokun polynomial
algorithm that i formulated as regards the implication graph
is about n which is 4
The RSA Cryptography involves the steps key generation
key distribution encryption and decryption and the analysis
involves a public and private key analysis such that it is
practical to find three very large positive numbers e d n such
that with modular exponentiation for m (me )d = m(modn)
where d is the private key exponent and e is the public key
exponent
The Encryption
For a message M represented by the integer m and for Alice
public key e then bob computes the cipher text c where m
and n are coprimes and m is in the range of 0 to n
The ciphertext c = me (modn)
The Decryption
Alice can recover the message m from c by using her private
key exponent d
cd = (me )d = m(modn)
The Key generation
the steps for the RSA cryptography are
get two distinct prime numbers p and q
compute n=pq
compute Q(n)=Q(p)Q(q)=(p-1)(q-1)=n-(p+q-1) where Q is
Euler totient function
get an integer e that is in the range 1 and Q(n) and
gcd(e,Q(n))=1
determine d the private key exponent as d = e1 mod(Q(n))
I explain the Seun Adedokun Polynomial Algorithm that i
formulate and why it is significantly better than the RSA
cryptography For the RSA Cryptography Complexity analysis it is expected that the public key exponent e should have
a short bit length and small hamming weight For efficient encryption it is observed that e is computed as 216 +1 = 65537
where n is the number of arguments i therefore show that
teh Seun Adedokun Polynomial Algorithm is significantly
better than the RSA cryptography in that i can compute e
=n based on the Seun Adedokun Polynomial Algorithm that i
formulate and therefore for a RSA CRYPTOGRAPHY that is
assumed to be computationally strong with a minimum value
of 65537 with the Seun Adedokun Polynomial Algorithm
that i formulate i can decrypt the RSA cryptography with a
value of e=n which is 16 thus showing The Seun Adedokun
Polynomial Algorithm that i formulate has a better computational complexity analysis that the RSA cryptography due to
the fact that i have formulated a better public key exponent
C. Analysis of the Computational complexity
I explain the code for the RSA Cryptography and i explain
the Seun Adedokun Polynomial Algorithm that i formulate

and that the Seun Adedokun Polynomial Algorithm is significantly better than the RSA cryptography
function modular multiplicative inverse
int t=0;
nt =1;
r=n;
if(n0)n=-n;
if (a < 0)a = n (a%n);
int nr= a % n;
while (nr !== 0) int quot=(r/nr) 0;
int tmp=nt ;
nt=t-quot*nt;
t=tmp int tmp=nr ;
nr=r-quot*nr;
r=tmp
if (r 1)cout -1
if (t0)t+=n;
cout t;
The function is the modular multiplicative inverse for the
computation of the private key exponent d
For the computation of the private key exponent d and the
public key exponent e
int p =randomp rime(1, 255);
int q= randomp rime(1, 255);
n=p * q;
t=(p-1) *(q-1);
e=randp rime(1, t);
d=modularmultiplicativeinverse(e, t);
cout n;
cout e;
cout d;
I explain the Seun Adedokun Polynomial Algorithm that i
formulated and the fact that the Seun Adedokun Polynomial
Algorithm is significantly better than the RSA Cryptography
From the computation of e=randp rime(1, t); if p = 4
and q=32 t=128 and if e=randp rime(1, t); is 65 therefore
e = 26 + 1 therefore if for the computation the public key
exponent has a value of 65 the Seun Adedokun Polynomial
Algorithm has a value of n=6 which shows that the Seun
Adedokun Polynomial Algorithm has a better computational
complexity analysis than the RSA cryptography Therefore
the Seun Adedokun Polynomial Algorithm for the analysis
is
int p =randomp rime(1, 255);
int q= randomp rime(1, 255);
n=p * q;
t=(p-1) *(q-1);
e=randp rime(1, t);
c = 2t1 d=modularmultiplicativeinverse(e, t);
cout c;
cout n;
cout e;
cout d;

For a prime value p and a primitive root modulo g

Alice selects a secret integer x and sends bob A = g x modp
Bob selects a secret integer b and sends alice B = g b modp
Alice computes r = B x modp
Bob computes r = Ab modp
Alice and Bob then has a secret r
For a message B that bob sends to Alice if B has a value
of 19 therefore it is expected that an algorithm to decrypt
the value 19 = 24 + 3 should run in a time lesser than
19 to decrypt it therefore the Seun Adedokun Polynomial
time algorithm will have the value of n=4 which is means
that the algorithm runs in a polynomial time O(4) which is
much better than the diffie hellman cryptography with an
exponent of the formO(24 + 3)

F. Paillier Cryptosystem

where c is the computed value of n from e = 26 +1 which

is 6
D. Integer factorization and RSA Analysis
The Polynomial quadratic sieve can be used to factor
the public modulus n the time taken to factor 128 bit and
256 bit n on a computer (processor intel dual core i74500U 1.8GHZ) ARE 2 Seconds and 35 Minutes the Seun
Adedokun Polynomial Algorithm that i formulate gives a
better factorization for the public modulus n
Bits Time
128 less than 2 seconds 192 16 seconds 256 35 minutes 260
1 hour
therefore what takes 35 minutes 25 + 3 for the polynomial
quadratic sieve to do for the 256 bits will take 5 minutes
for the Seun Adedokun Polynomial Algorithm which is
significantly better than the RSA cryptography and the Seun
Adedokun Polynomial Algorithm is significantly better than
the polynomial quadratic sieve
E. Diffie Hellman Cryptography
The Diffie Hellman cryptography is based on the fact
that two parties that have no prior knowledge of each other
to jointly establish a shared secret key over an insecure
channel this key can then be used to encrypt subsequent
communications using a symmetric key cipher
Based on the color analysis for the diffie hellman
cryptography where both alice and bob starts on the same
color which is yellow and each of them selects a secret color
which is red and aqua that they keep to themselves they
now mix their secret color with the starting color resulting
in orange and blue mixture then each get the others public
mix and they then mix this with their secret color to get a
the brown mixture the brown mixture is then the common
secret between alice and bob
cryptogrraphic analysis of the diffie hellman cryptography

The paillier cryptosystem is a probabilistic asymmetric

algorithm for public key cryptography
The Encryption
For the encryption the ciphertext c is computed where c =
g m rnmodn2
For the Decryption
the plaintext message m = L(c modn2 )modn where
n=pq is computed from the
function L is L(x) = x1
n
modular multiplicative inverse and = lcm(p 1q 1)
I explain the Seun Adedokun polynomial Algorithm that
i formulate and i show that the Seun Adedokun Polynomial
Algorithm is significantly better than the Paillier cryptosystem
For the analysis the cryptosystem should provide semantic
security against plaintext attacks the ability to successfully
distinguish the challenge ciphertext amounts to the ability
to decide composite residuosity even though the decisional
composite residuosity assumption is assumed to be intractable with the Seun Adedokun Polynomial algorithm that
i formulate i can analyze the decisional composite residuosity
assumption and therefore the decisional composite residuosity assumption is tractable
The fact that i can explain teh intractibility and make it
tractable is based on the fact that for a computed c is it
possible to change m the message in a meaningful way
Therefore if the computed value of c is 33 which is 25 + 1 it
is known that at the best the paillier cryptosystem cannot
be tractable by an algorithm of the order lesser than 33
O(25 +1) with the Seun Adedokun Polynomial algorithm that
i formulate i can easily show that the paillier cryptosystem is
tractable based on the fact that teh algorithm that i formulate
to make it tractable runs in a polynomial time of the order
n where n is 5
I therefore formulate a more secure informational theoretical
analysis in Semantic security
i formulate a more secure online payment system and online
voting system based on my formulation since I can also
explain the practical application of this in Electronic cash
and Electronic voting where the identity of the person paying

by card online or voting is analyzed and i formulate a more

secure informational theoretical analysis
G. Cramer Shoup Cryptosystem
The Cramer Shoup cryptosystem is an asymmetric key
encryption algorithm which is a scheme said to be secure
against adaptive chosen ciphertext attack but with teh Seun
Adedokun Polynomial Algorithm that i formulate i show that
the Seun Adedokun Polynomial Algorithm is significantly
better than the Cramer Shoup Cryptosystem
The Encryption Bob sends the ciphertext (u1 u2 ev) to alice
where for a random value of k u1 = g1k u2 = g2k where g1
and g2 are random generator values e = hk m where h = g1z
where z is a random value and m is the message
The Decryption Alice decrypts by computing = H(u1 u2 e)
and verifies ux1 1 u2x2 (uy11 uy22 ) = v where v = ck dk where
c = g1x1 g2x2 and d = g1y1 g2y2
I have formulated the Seun Adedokun Polynomial
Algorithm and i show that it is significantly better than the
cramer shoup cryptosystem based on my analysis of the
four ciphertext messages (u1 u2 ev) bob sends to alice
therefore if the minimum values set on these four values
for prevention of the cramer shoup cryptosystem is 18 32
129 65 which can be expressed in teh exponential form
of the order O(24 + 2) O(25 ) O(27 + 1) O(26 + 1) i can
easily show that the Seun Adedokun Polynomial Algorithm
that i formulate is significantly better than the cramer
shoup cryptosystem since the Seun Adedokun Polynomial
algorithm will run in a polynomial time of the order 4 5 7 6

H. Elgamal cryptosystem
The Elgamal encryption system is an asymmetric key
encryption algorithm for public key cryptography based on
teh diffie hellman analysis where its security depends on the
difficulty of of a certain problem in cyclic group related to
computing discrete logarithm
The Encryption
0
Bob sends the ciphertext (c1 c2 ) = (g y m hy ) to Alice where
g is a random generator value m is the message x y are
random values in the range 0 to q-1 h = g x
The Decryption
0
Alice then computes m = c2 s1 which she converts to the
0
message m where s = cx1 and c1 = g y and c2 = m s and
0
m is the message mapped to an element m of the cyclic
group
I show that the Seun Adedokun Polynomial Algorithm is
significantly better than the Elgamal cryptosystem based on
0
the analysis of the ciphertext message (c1 c2 ) = (g y m hy )
bob sends to alice
if Bob sends the three ciphertext message 64 257 129 to alice
which is of the exponential order O(26 )O(28 + 1)O(27 + 1)
then i show that the Seun Adedokun Polynomial Algorithm
that i formulate runs in a polynomial time of the order 6 8
7

I. Digital Signature Algorithm

The Digital Signature Algorithm is based on two phases
the first phase is on the selection of the algorithm parameters
while teh second phase in on the computation of the private
and public key for the individual member
The first phase of the digital signature algorithm is based
on the parameters p q g that the individual members have
access to
The second phase of the digital signature algorithm is based
on the computation of the private and public key for the
individual members where for a secret key x there is a public
key y = g x modp
I show that the Seun Adedokun Polynomial algorithm that i
formulate is significantly better than digital signature algorithm based on the parameters p q g which for the digital
signature algorithm the individual members have access to
if the parameters p q g have values 513 256 1025 the
parameters can be expressed in the exponential order notation
O(29 + 1) (28 ) (210 + 1) the Seun Adedokun polynomial
Algorithm that i formulate runs in the polynomial time of
the order 9 8 10
III. P RACTICAL SOLUTION IN P ROTOCOL A NALYSIS
A. S/MIME
S/MIME is a public key encryption and signing of MIME
data based on RSA data security and provides crytographic
security services for electronic messaging applications like
Authentication message integrity Non repudiation of origin
based on digital signatures and privacy
I have shown that the Seun Adedokun Polynomial
Algorithm that i formulate is significantly better than the
RSA cryptography and the public key encryption and i have
shown that i have formulated a more secure informational
cryptography analysis
B. GPG
GPG is the GNU privacy guard is a hybrid encryption
software program that is based on a combination of
symmetric key cryptography and public key cryptography
and it supports the following public key RSA Elgama
I have shown that the Seun Adedokun Polynomial Algorithm
is significantly better than the symmetric key cryptography
the public key cryptography and that the Seun Adedokun
Polynomial Algorithm is significantly better than RSA and
ELgama
C. PGP
PGP is the pretty good privacy encryption program that
provides cryptographic privacy and authentication for data
communication and can be used for signing encrypting and
decrypting texts emails files directories
PGP encryption uses a serial combination of hashing data
compression symmetric key cryptography and public key
cryptography
I have shown that the Seun Adedokun Polynomial Algorithm

that i formulate is significantly better than symmetric key

cryptography Public key cryptography hashing and data
compression and therefore the Seun Adedokun Polynomila
algorithm that i formulate is more secure for signing
encrypting and decrypting texts emails files directories
D. ZRTP
ZRTP is a cryptographic key agreement protocol to negotiate the keys for encryption between two endpoints in a
voice over internet protocol phone telephony call based on
the real time transport protocol
it is based on the diffie hellman analysis and the secure real
time transport protocol for encryption
I have shown that the Seun Adedokun Polynomial Algorithm
that i formulate is significantly better than the diffie hellman
analysis and it is also secure as regards mobile security
E. Secure Socket Layer
Secure socket layer are cryptographic protocols that provide communication security over a computer network
the connection is private because symmetric cryptography is
used to encrypt the data transmitted and the identity of the
communicating parties can be authenticated based on public
key cryptography
I have shown that the Seun Adedokun Polynomila Algorithm
that i formulate is significantly better than the symmetric
cryptography and the public key cryptography
F. SILC
SILC which is a secure live internet conferencing protocol
is a protocol that provides secure synchronous conferencing
services over the internet
it is based on diffie hellman analysis and digital signature
algorithm
I have shown that the Seun Adedokun Polynomial Algorithm
is significantly better than the diffie hellman analysis and
the digital signature algorithm therefore the seun adedokun
polynomial algorithm is more secure for synchronous conferencing services over the internet
G. SSH
secure Shell is a cryptographic network protocol for operating network services securely over an unsecured network
it is based on public key cryptography
I have shown that the Seun Adedkun Polynomial Algorithm
is significantly better than the Public key cryptography
therefore teh Seun Adedokun Polynomial algorithm is more
secure as a protocol for operating network services over an
unsecured network
IV. CONCLUSIONS
This is manuscript 4 of my solution of the P versus NP
problem I explain the Seun Adedokun Polynomial Algorithm
and the practical solution to public key cryptography
I explain the Seun Adedokun Polynomial Algorithm that i
formulate and that the Seun Adedokun Polynomial algorithm
is significantly better than the Public key Cryptography

I explain the Seun Adedokun Polynomial Algorithm that i

formulate and that the Seun Adedokun Polynomial algorithm
is significantly better than the RSA Encryption Algorithm
I explain the Seun Adedokun Polynomial Algorithm that i
formulate and that the Seun Adedokun Polynomial algorithm
is significantly better than the Digital Signature Algorithm
I explain the Seun Adedokun Polynomial Algorithm that i
formulate and that the Seun Adedokun Polynomial Algorithm is significantly better than the Pallier cryptosystem
I explain the Seun Adedokun Polynomial Algorithm that i
formulate and that the Seun Adedokun Polynomial Algorithm is significantly better than the Cramer shoup cryptosystem
I explain the Seun Adedokun polynomial algorithm that i
formulate and that the Seun Adedokun Polynomial Algorithm is significantly better than protocols using asymmetric
key algorithms like S/MIME GPP PGP ZRTP Secure VOIP
Protocol secure Socket Layer SILC SSH and that the Seun
Adedokun Polynomial algorithm is more secure than the
protocols .
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