250

Boolean Algebra based Effective and

Efficient Asymmetric Key Cryptography
Algorithm: BAC Algorithm
Niraj Kumar Pankaj Gupta Monika Sahu Dr. M A Rizvi
M.Tech M.Tech M.Tech Associate Professor
NITTTR,Bhopal(M.P.) NITTTR,Bhopal(M.P.) NITTTR,Bhopal (M.P.) NITTTR, Bhopal (M.P.)

Abstract: The Internet was born of academic efforts to share commerce and payments to private communications and
information; it never strove for high security measures. It protecting passwords. This is where, cryptography and
plays important role in becoming people online, this mode is steganography comes into play. Cryptography is the
easy and effective but dangerous too in terms of data technique used for converting the secured message into
hacking and cracking by unauthorized persons. It is needed
undecipherable format during the transmission of data
that while using Internet data must be secured and personal.
Encryption can be used to protect data in transit, for through network. Cryptography is an indispensable tool
example data being transferred via network (e.g. the for protecting information in computer systems."It is the
Internet, e-commerce), mobile telephones, wireless science and study of secret writing" concerns the ways in
microphones, wireless intercom systems, Bluetooth devices which communications and data can be encoded to
and bank automatic teller machines. Encrypting data in prevent disclosure of their contents through
transit also helps to secure it as it is often difficult to eavesdropping or message interception, using codes,
physically secure all access to networks. ciphers and other methods, so that only authorized
persons can see the real message[2]. It is a modern as well
Encryption, by itself, can protect the confidentiality of
as ancient science. To send message from source to
messages, but other techniques are still needed to protect the
integrity and authenticity of a message; for example, destination there is a chance of data theft and access by
verification of a message authentication codes (MAC) or a unauthorized persons. In ancient time king send
digital signature. Standards and cryptographic software and information in secret code to other emperor because of
hardware to perform encryption are widely available, but information dissemination. Similarly in modern era in
successfully using encryption to ensure security may be a computer networking there is need of cryptography to
challenging problem. A single slip-up in system design or secure information from unauthorized person. Many
execution can allow successful attacks. Sometimes an researchers have done the work in this area and formulate
adversary can obtain unencrypted information without new algorithms on cryptography [8,9,11,10].
directly undoing the encryption. In this paper an attempt is
made to develop new encryption and decryption algorithm
and implemented in Java, it gives very encouraging results Cryptography is the most secure techniques which uses
in small as well as in large data files. mathematical calculations and a variable value known as
a 'key'. The selected key (often any random character
Keywords: Cryptography, Encryption, Decryption, MAC string) is input on encryption and is integral to the
(Message Authentication Code), BAC Algorithm (Boolean changing of the data [3]. In cryptography plain text is
Algebra Cryptography), Complement, XOR operation, Unicode converted into unreadable cipher text with the help of key,
this is process is called encryption of message during
I. INTRODUCTION transfer of data [4]. The process of converting unreadable
cipher text to readable text format is called decryption.
During this time when the Internet provides essential There are two types of basic technique for encryption.
communication between tens of millions of people and is
being increasingly used as a tool for commerce, security a) Symmetric Encryption: Symmetric encryption is
becomes a tremendously important issue to deal with[1]. well known and oldest technique of data
In network communication there is a lot of security and encryption. In this process secret key is needed
safety approaches are used during communication. The for encryption and decryption .This secret key is
security is required to keep the data safe and intact. But a number, a string or a word which is applied on
when this confidential data or information is transit the textual message to change the content in a
becomes vulnerable to the unauthorized attacks by particular way .This secret key is known to both
hackers or by unauthorized users. There are many aspects sender and receiver. They use same key for
to security and many applications, ranging from secure encryption and decryption.[5]

978-1-4673-5090-7/13/$31.00 ©2013 IEEE

 251

b) Asymmetric encryption: In this method two Keep all the values d, p, q and phi secret. It is prefer
different secret key are required, in the earlier sometimes to write the private key as (n, d) because you
case it is easy for unauthorized person to decrypt need the value of n when using d, n is known as the
the message easily if anyone get the key from modulus, e is known as the public exponent or encryption
any source. Asymmetric encryption is difficult exponent or just the exponent, d is known as the secret
but is more secure and safer then symmetric exponent or decryption exponent [7].
encryption technique. In this method a pair of
key is required for encryption and decryption. Procedure of Encryption
These keys are known as public key and private 1. Obtains the recipient B's public key (n, e).
key. Private key is different for sender and 2. Represents the plaintext message as a positive integer
receiver but public key is same for both. m, 1 < m < n.
Asymmetric process is slower than symmetric 3. Computes the cipher text c = m*e mod n.
technique. 4. Sends the cipher text c to B.

Data communication normally takes place over an Procedure of Decryption

unsecured channel, as is the case when the Internet 1. Uses his private key (n, d) to compute m = cd mod n.
provides the pathways for the flow of data. In such a case 2. Extracts the plaintext from the message representative
the cryptographic protocols would enable secured m. Summary of RSA
communications by addressing the following. . n = pq, where p and q are distinct primes.
. phi, ij = (p-1)(q-1)
• Confidentiality: assuring that private data remains . e < n such that gcd(e, ij)=1
private. . d = e-1 mod ij.
• Authentication: assuring the identity of all parties . c = m*e mod n, 1<m<n.
attempting access. . m = c*d mod n[7].
• Authorization: assuring that a certain party
attempting to perform a function has the relevant Weaknesses in RSA
permissions to do so.
• Data Integrity: assuring that an object is not altered 1. Small encryption exponent: For small exponent like
illegally. e=3 and send the same message to different recipients
• Non-Repudiation: assuring against a party denying a and just use the RSA algorithm without adding
data or a communication that was initiated by random padding to the message, then an
them.[6] eavesdropper could recover the plaintext.
2. Using the same key for encryption and signing:
This concludes that in current situation we need an Mathematics involved is the same for encryption and
asymmetric cryptographic algorithm which takes lesser decryption (signing), only in reverse method, if an
time than the current existing algorithms and work more attacker hack a key holder to sign an unformatted
efficiently. encrypted message using the same key then, will get
the original message.
II. RSA ALGORITHM 3. Acting as an oracle: There are techniques to recover
the plaintext if a user just blindly returns the RSA
In recent time RSA cryptosystem is the most widely-used transformation of the input. So it is not
public key based cryptography algorithm. In this method, recommended.
to encrypt a message there is no need to exchange a secret 4. This process takes more time in calculation during
key separately. This algorithm can be used for both public encryption and decryption.
key encryption and in digital signatures. Its security is
based on the difficulty of factoring large integers. The To remove the deficiencies and shortcomings of the RSA
RSA algorithm is as follows: and other widely used asymmetric cryptographic
algorithm. In this work it is tried to present a new
1. Choose two large random primes number p and q cryptography algorithm which is more effective and
where p*q >= 10,000 efficient. The said algorithm apply different mathematical
2 Compute n = pq and (phi) ij = (p-1)(q-1). operations on binary converted data of ASCII value of
3 Choose an integer e, 1 < e < ij, such that gcd(e, ij) = 1. data i.e. 1’s complement, 2’s complement, XOR and mod.
4 Compute the secret exponent d, 1 < d < ij, such that ed
Ł 1 (mod ij).
5 The public key is (n, e) and the private key (d, p, q).
 252

III. METHODOLOGY USED

In this work a new method has been developed for data

encryption and decryption. The public-key and private
key cryptosystem is on combination between modular
calculations of:
• 1’s component: Take the binary of ASCII value of
data given as input and replace 0 with 1 and vice
versa.
• 2’s component: Take the 1’s complement of data and
then add 1 in it.
• X-OR operation,

Characteristics of the above method Fig : Encryption and decryption process

1) It is secure as well as practical
2) Difficult to decrypt IV. ALGORITHM FORMULATED
3) Can be used for encryption, key exchange, and entity
authentication. Encryption: In cryptography, encryption is the process
4) Describe the public-key cryptosystem algorithm, its of transforming information (referred to as plaintext)
software implementation, security and properties. using an algorithm (called a cipher) to make it unreadable
to anyone except those possessing special knowledge,
Encryption and decryption take place according to public usually referred to as a key. It is performed at the sender
key and private key with some mechanism. 1’s and 2’s side through the encryption algorithm. In this algorithm
complement and XOR operation are used for encryption Sender enters the plain text; the algorithm first takes
and decryption. Algorithm is used to convert plaintext to ASCII values of each character, number and symbol from
cipher text (i.e. encryption of text) and cipher text to plain 0-255. Now it adds private number to ASCII value, this
text (i.e. Decryption of text). The algorithm uses the private value act like private key. After adding it takes
Unicode ASCII value for conversion; it takes ASCII value mod of resultant and convert every respected integer into
of each character, number and symbol. binary number, now it performs 2’s complement then 1’s
complement of each binary number. At the end it
After implementing this algorithm on various characters, performs XOR operation with public key. This makes our
numbers and symbol in massages, it is found that after result as cipher text.
encryption, the cipher text will be totally secured and
unreadable. In this method ASCII values of characters, Algorithm for encryption:
numbers and symbols are manipulated. ASCII values
converted into binary number and it takes 32 bits in Step1: Initialize array to store all characters, numbers and
implementation. Other algorithms are using 128 bit symbols of the plain text.
encrypting and decrypting techniques, which are required Step2: Convert all characters, numbers and symbols into
more space in data transfer. 1’s and 2’s complement and its ASCII value.
XOR of data are used to encrypt data in this algorithm Step3: Add a private number to ASCII value as a private
which no other researcher has applied so far. Public and key into the ASCII valued text.
Private Keys are used in encryption and decryption Step4: X mod 256=Y.
process. It is found to be an efficient process for coding Step5: Convert Y valued into its binary number.
and decoding. Step6: Take 2’s complement of binary valued text.
Step7: Take 1’s complement of 2’s complemented binary
valued text.
Step8: Apply XOR operation of binary valued text with
public key
Step9: After step 8 we got our cipher text to send over the
network.
 253

Flow Chart of Encryption: Flow Chart of Decryption:

Decryption: The process of decoding data that has

been encrypted into a secret format. Decryption requires a
secret key or password. It is done at the receiver end, So
in decryption process the our decryption algorithm
performs XOR operation between public key and cipher
text then it takes 1’s compliment and 2’s complement of
resultant binary values. Now resultant values are
converted into integer then after it will add with private
key and takes mod with 256. The resultant ASCII values
converted to plain text again.

Algorithm for Decryption: V. CONCLUSION

Step1: Initialize two dimensional array to store 32 bits
binary number and all cipher text. Data security is foremost requirement while transferring
Step2: Perform XOR operation of binary valued text with data on network. Data hacking is the major threat while
public key. data transfer on network. When there is need of data
Step3: Takes 1’s complement of binary valued text. transferred on the network with security, the cryptography
Step4: Takes 2’s complement of 1’s complement binary comes into picture, and this is the combination of
valued text. encryption and decryption of data or message.
Step5: Convert binary valued to its resultant ASCII
values. In this paper a new 32 bit encryption and decryption
Step6: Add with private number into resultant ASCII algorithm is developed for secured data transfer in form
valued that is Y. of small and large files. This algorithm uses 1’s and 2’s
Step7: Y mod 256= X. complement and XOR operation on plain text and cipher
Step8: Convert X into its resultant characters, numbers text. The implementation is done in Java for both small
and symbols. and large text files. This method of encryption and
Step9: After step 8 cipher text again converted into plain decryption is unique and no other researcher has ever
text.
 254

used this technique. This work can be further extended for [7] TCP/IP Protocol suite Behrouz A. Forouzan
[8] efficient Multiplication in GF(p^k) for Elliptic curve cryptography
other data types. J.C Bajard, L.Imbert, C. Ngre and T. Plantard, 1063-6889/2003 IEEE.
[9] Block Encryption standard for transfer of data Akhil Kaushik, Manoj
REFERENCES: Barnela, Anant Kumar
978-1-4244-7578-0, 2010 IEEE
[1] http://www.garykessler.net/library/crypto.html [10]An Integrated Symmetric key Cryptography Algorithm using
[2] http://www.netsec.org.sa/cryptography.htm Generalised modified
[3] http://www.cryptographyworld.com/what.htm Vernam Cipher method and DJSA method: DJMNA symmetric key
[4] W. Stallings, "Cryptography and network security principles and algorithm Debanjan Das, Megholova Mukharjee, Neha Choudhary, 978-
practice," Fourth edition, Prentice hall, 2007 1-4673-0126-8/2011 IEEE.
[5] dspace.fsktm.um.edu.my/.../1/M-XKMS-WGA070097.pdf [11]A new symmetric key cryptography algorithm using extended MSA
[6] http://www.netsec.org.sa/cryptography.html method: DJSA symmetric key algorithm, dripto chatterjee, Joyshree
Nath, suvadeep Dasgupta, Ashok nath, 978-0-7695-4437-3 2011 IEEE.
[12]A.S, Tanenbaum, Computer Networks, Fourth edition, prentice hall
2004
[13]www.indiastudychannel.com/.../5078-11329-rsa-algorithm.doc