<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Public-Key hybrid cryptosystem based on Blowfish and RSA</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Elza Jintcharadze</string-name>
          <email>elza.jincharadze@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Cyber Security Department Caucasus University</institution>
          ,
          <addr-line>Tbilisi</addr-line>
          ,
          <country country="GE">Georgia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Faculty of Informatics and Control Systems Georgian Technical University Tbilisi</institution>
          ,
          <country country="GE">Georgia</country>
        </aff>
      </contrib-group>
      <fpage>52</fpage>
      <lpage>55</lpage>
      <abstract>
        <p>- Nowadays data security is one of the important issues, especially for increasing transactions via the internet. This paper presents a hybrid cryptosystem using RSA (Asymmetric) and Blowfish (Symmetric) algorithm. Hybrid encryption is a combination of symmetric and asymmetric encryption methods. Symmetric algorithms are mostly used for encryption of messages than asymmetric.</p>
      </abstract>
      <kwd-group>
        <kwd>Symmetric cryptography</kwd>
        <kwd>Asymmetric cryptography</kwd>
        <kwd>Data encryption</kwd>
        <kwd>Ciphertext</kwd>
        <kwd>Decryption</kwd>
        <kwd>Hybrid cryptosystem</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>INTRODUCTION</p>
      <p>Nowadays strength of the cryptosystem cannot be totally
ensured. The main goal of all cryptography algorithms is to
offer the best security, but due to the fact that technology is
rapidly developing proposed security systems becoming
less resistant to every known or new attacks.</p>
      <p>
        Both symmetric and asymmetric key algorithms have
their advantages and disadvantages. Symmetric key
algorithms are faster than asymmetric algorithms. The main
requirement is that the secret key must be shared in a secure
way. Asymmetric systems provide secure transmission of
keys, but this process needs much more time. To improve
this problem is used the hybrid algorithm, which means
using a different type of cryptosystems together [
        <xref ref-type="bibr" rid="ref19">22</xref>
        ].
      </p>
      <p>II.</p>
      <p>RSA</p>
      <p>
        RSA is founded in 1977 is a public key cryptosystem.
RSA is an asymmetric cryptographic algorithm named after
its founders Rivest, Shamir &amp;Adelman [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. In general, RSA
cryptosystem is used to provide privacy and ensure the
authenticity of digital data. Nowadays RSA is implemented
in many commercial systems. RSA is used to ensure privacy
and authenticity for web servers and browsers, to provide
security for web Email and remote login sessions for
creditcard payment systems. RSA is frequently used in
applications where the security of digital data is important.
      </p>
      <p>III.</p>
    </sec>
    <sec id="sec-2">
      <title>BLOWFISH</title>
      <p>
        Blowfish is one of the symmetric key algorithms with a
64-bit block cipher and it was developed by Bruce
Schneider [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Blowfish is a block cipher, the encryption
process, and the decryption, Blowfish divides a message
into blocks of equal size in length, i.e. 64 bits. Nowadays
blowfish provides good security level and there is no
successful crypto attack against it. By encryption time
Blowfish is faster than DES, but the weak point for this
algorithm is its weak key.
      </p>
      <p>IV.</p>
    </sec>
    <sec id="sec-3">
      <title>DESCRIPTION OF HYBRID CRYPTOSYSTEM</title>
      <p>
        Hybrid encryption is a method of encryption that
combines two or more encryption systems. It integrates a
combination of asymmetric and symmetric encryption to
take benefit from the strengths of each form of encryption.
These strengths of the algorithm are defined as speed and
security of this algorithm. Hybrid encryption is considered
a highly secure type of encryption as long as the public and
private keys are fully secure [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>
        A hybrid encryption scheme is one that combines the
convenience of an asymmetric encryption scheme with the
effectiveness of the symmetric encryption scheme. There
are various advantages of the combination of encryption
methods. One is that users have the ability to communicate
through hybrid encryption. Usually, during the encryption
process, the asymmetric algorithm is slowing down the
encryption process [
        <xref ref-type="bibr" rid="ref13">15</xref>
        ]. But hybrid cryptosystem is using
symmetric encryption synchronously so both forms of
encryption (symmetric and asymmetric) are improved. The
result of the hybrid encryption process has an additional
security level with overall improved system performance.
      </p>
      <p>
        Symmetric and asymmetric cryptography algorithms
have their own advantages and disadvantages. In general,
symmetric ciphers are considerably faster than asymmetric
ciphers, but require all parties to somehow share a secret
key. Also, we have to take into consideration that
asymmetric algorithms allow public key arrangements and
key exchange systems, but this slowdowns encryption
process speed [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. A hybrid cryptosystem is using multiple
ciphers of different types together, each to its best
advantage. One common method of a hybrid cryptosystem
is to generate a random secret key for a symmetric cipher,
and then encrypt this key via an asymmetric cipher using the
recipient’s public key. After this step, the plaintext is
encrypted using the symmetric cipher and the secret key.
After the encryption process, the encrypted secret key and
the encrypted message will be then sent to the receiver.
      </p>
      <p>The main goal of a hybrid cryptosystem is to generate a
random key for the symmetric system and after this encrypt
this key for the asymmetric system. So, we will get a secret
key that will be used for encryption plaintext. During
Hybrid encryption process data are transferred using unique
session keys along with symmetrical encryption. The public
key encryption process is implemented for random
symmetric key encryption. After the receiver gets the
encrypted message, the public key encryption method is
used to decrypt the symmetric key. After recovering of the
symmetric key, then it is used to decrypt the message.</p>
      <p>To create a strong encryption algorithm there is a
proposed combination of two encryption algorithms
Blowfish and RSA. There were done experiments on
proposed algorithms by terms of their encryption speed,
used memory and system requirements. The programming
language Java is used for implementing the encryption</p>
      <p>In general encryption time is connected to algorithm
architecture. Table 1 shows encryption and decryption
results on Blowfish algorithms. Size of used key is 16 bits.</p>
      <p>The same experiment was done on RSA system, where
was used different size of plaintext. Table 2 shows used
encryption time in nanoseconds.</p>
      <p>The proposed hybrid cryptosystem works as following
at first system reads plaintext and generates the secret key
with RSA and public keys are generated automatically. The
next step is to generate Blowfish symmetric key which will
be encrypted with RSA system. This provides high security
for the key because the usage of RSA algorithm decreases
the decryption probability of public key. So, when we share
the public key, will be shared also RSA secret key. After
these steps, the plaintext is encrypted using Blowfish,
because as other symmetric algorithms Blowfish is fast. The
decryption process is the reverse process of the
abovedescribed</p>
      <p>There was created program, implementation for this
hybrid cryptosystem on Java programming. Table 3 shows
program execution results on different size plaintext.
Blowfish Decryption time (Nanoseconds)</p>
      <p>RSA + Blowfish Decryption time (nanoseconds)</p>
    </sec>
    <sec id="sec-4">
      <title>VI. CONCLUSION AND SCOPE OF FUTURE WORK</title>
      <p>This paper provides a description and comparative
analyses of the new hybrid cryptosystem model. The new
hybrid model combines Blowfish (symmetric) and RSA
(Asymmetric) cryptosystems. The paper shows program
implementation and experimental research results with java
programing language. Described algorithms and hybrid
models are evaluated by terms of encryption speed, memory
usage, encrypted file size and ensured security level. Taking
into account the time and consumption of the technical
resources, Blowfish is the best one else than the other
reviewed.
3 2</p>
      <p>6 4 1 2 8 2 5 6 5 1 2 1 0 2 42 0 4 84 0 9 6
RSA Decrypted file size (KB)</p>
      <p>RSA + Blowfish Encrypted File size (KB)</p>
      <p>As a conducted experimental result shows provided
new hybrid model is significantly faster and secure because
it takes all advantages and strength of symmetric and
asymmetric systems. The experiment showed the following
results:



</p>
      <p>If Blowfish, RSA and Blowfish + RSA hybrid
algorithms are compared according to the memory
used, the highest technical resources require RSA
algorithm, and Blowfish is slightly behind the
Blowfish + RSA hybrid scheme.</p>
      <p>Considering the option of encryption Blowfish
keeps its initial first position and is the fastest of
these systems. However, the Blowfish + RSA
hybrid algorithm is far below and significantly
faster than RSA. And RSA takes the longest time
to encrypt and is very slow.</p>
      <p>Observation of the decryption time parameters has
shown that the Blowfish + RSA hybrid algorithm
and the blowfish algorithm are almost equally fast
with the decryption process and are faster than the
RSA algorithm.</p>
      <p>As an overview of the encrypted file size setting,
the lowest memory needs Blowfish system, the
following is Blowfish + RSA, and the RSA
algorithm increases the size of an encrypted file
with the highest rate.</p>
      <p>For the future is possible to review another hybrid
model of symmetric and asymmetric algorithms. It is
possible to conduct a series of entropy research of the
different cryptographic algorithms and the above-presented
hybrid model. This will allow us to identify the
sustainability of each algorithm against different types of
attacks, including the frequency analysis of the encrypted
text.</p>
    </sec>
    <sec id="sec-5">
      <title>REFERENCES</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>B.</given-names>
            <surname>Schneier</surname>
          </string-name>
          , “
          <article-title>Description o f a New Variable-Length Key</article-title>
          ,
          <fpage>64</fpage>
          -Bit Block Cipher (Blowfish)”, Fast Software Encryption, Cambridge Security Workshop proceedings (
          <year>December 1993</year>
          ), Springer-Verlag,
          <year>1994</year>
          , pp.
          <fpage>191</fpage>
          -
          <lpage>204</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <article-title>[2] "The Digital Millennium Copyright Act of 1998" (PDF)</article-title>
          .
          <source>United States Copyright Office. Retrieved 26 March</source>
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Cramer</surname>
          </string-name>
          , Ronald; Shoup,
          <string-name>
            <surname>Victor</surname>
          </string-name>
          (
          <year>2004</year>
          ).
          <article-title>"Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack"</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Hofheinz</surname>
          </string-name>
          , Dennis; Kiltz,
          <string-name>
            <surname>Eike</surname>
          </string-name>
          (
          <year>2007</year>
          ).
          <article-title>"Secure Hybrid Encryption from Weakened Key Encapsulation"</article-title>
          .
          <source>Advances in Cryptology - CRYPTO 2007</source>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Johhanes</surname>
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Buhman</surname>
          </string-name>
          , Introduction to Cryptography, Second Edition,
          <year>2000</year>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Alfred</surname>
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Menezes</surname>
          </string-name>
          , Paul C. van
          <string-name>
            <surname>Oorschot</surname>
            ,
            <given-names>Scott A.</given-names>
          </string-name>
          <string-name>
            <surname>Vanston</surname>
          </string-name>
          , Handbook of Applied Cryptography, Massachusetts Institute of Technology, June 1996
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Ilya</surname>
            <given-names>KIZHVATOV</given-names>
          </string-name>
          , Physical Security of Cryptographic Algorithm Implementations,
          <string-name>
            <surname>L</surname>
          </string-name>
          'UNIVERSITÉ DU LUXEMBOURG,
          <year>2009</year>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Simson</given-names>
            <surname>Garfinkel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Alan</given-names>
            <surname>Schwartz</surname>
          </string-name>
          , Gene Spafford,
          <string-name>
            <surname>Practical</surname>
            <given-names>UNIX</given-names>
          </string-name>
          and
          <article-title>Internet Security, 3rd Edition Securing Solaris, Mac OS X, Linux</article-title>
          &amp; Free BSD
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <article-title>[9] The official Advanced Encryption Standard"</article-title>
          .
          <source>Computer Security Resource Center. National Institute of Standards and Technology. Retrieved 26 March</source>
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [12]
          <article-title>"Quantum cryptography: An emerging technology in network security"</article-title>
          .
          <article-title>-</article-title>
          <string-name>
            <surname>Sharbaf</surname>
          </string-name>
          , M.S. IEEE International Conference on Technologies for Homeland Security.
          <year>2011</year>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Adleman</surname>
          </string-name>
          ,
          <string-name>
            <surname>Leonard</surname>
            <given-names>M.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Rothemund</surname>
          </string-name>
          , Paul W.K.;
          <string-name>
            <surname>Roweis</surname>
          </string-name>
          , Sam; Winfree,
          <string-name>
            <surname>Erik</surname>
          </string-name>
          (June 10-12,
          <year>1996</year>
          ).
          <article-title>On Applying Molecular Computation To The Data Encryption Standard</article-title>
          .
          <source>Proceedings of the Second Annual Meeting on DNA Based Computers</source>
          . Princeton University.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Cramer</surname>
          </string-name>
          , Ronald; Shoup,
          <string-name>
            <surname>Victor</surname>
          </string-name>
          (
          <year>2004</year>
          ).
          <article-title>"Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack"</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Hofheinz</surname>
          </string-name>
          , Dennis; Kiltz,
          <string-name>
            <surname>Eike</surname>
          </string-name>
          (
          <year>2007</year>
          ).
          <article-title>"Secure Hybrid Encryption from Weakened Key Encapsulation"</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Taher</surname>
            <given-names>ElGamal</given-names>
          </string-name>
          (
          <year>1985</year>
          ).
          <article-title>«A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Hamdan</surname>
            <given-names>O.</given-names>
          </string-name>
          <string-name>
            <surname>Alanazi</surname>
            ,
            <given-names>B. B.</given-names>
          </string-name>
          <string-name>
            <surname>Zaidan</surname>
            ,
            <given-names>A. A.</given-names>
          </string-name>
          <string-name>
            <surname>Zaidan</surname>
          </string-name>
          , Hamid A.
          <string-name>
            <surname>Jalab</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Shabbir</surname>
            and
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Al-Nabhani</surname>
          </string-name>
          , “
          <article-title>New Comparative Study Between DES, 3DES and AES within Nine factors”</article-title>
          ,
          <source>Journal of Computing</source>
          , Volume,
          <volume>2</volume>
          ,
          <string-name>
            <surname>Issue</surname>
            <given-names>3</given-names>
          </string-name>
          ,
          <year>March 2010</year>
          , pp.
          <fpage>152</fpage>
          -
          <lpage>157</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Dr</surname>
          </string-name>
          .
          <article-title>Prerna Mahajan and Abhishek Sachdeva, “ A study of Encryption Algorithms AES, DES and RSA for Security”</article-title>
          ,
          <source>Global Journal of Computer Science and Technology Network, Web &amp; Security</source>
          , Volume
          <volume>13</volume>
          Issue
          <issue>15 Version 1</issue>
          .
          <issue>0 Year 2013</issue>
          , pp.
          <fpage>15</fpage>
          -
          <lpage>22</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [20]
          <article-title>Deepak Kumar Dakate and Pawan Dubey, “Performance comparison of Symmetric Data Encryption Techniques”</article-title>
          ,
          <source>International Journal of Advanced Research in Computer Engineering and Technology</source>
          , Volume
          <volume>3</volume>
          , No. 8,
          <year>August 2012</year>
          , pp.
          <fpage>163</fpage>
          -
          <lpage>166</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Sumitra</surname>
          </string-name>
          , “
          <article-title>Comparative Analysis of AES and DES security Algorithms”</article-title>
          ,
          <source>International Journal of Scientific and Research Publications</source>
          , Volume
          <volume>3</volume>
          ,
          <string-name>
            <surname>Issue</surname>
            <given-names>1</given-names>
          </string-name>
          ,
          <year>January 2013</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>5</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Maksim</surname>
            <given-names>Iavich</given-names>
          </string-name>
          ; Sergiy Gnatyuk ; Elza Jintcharadze ; Yuliia Polishchuk ; Roman Odarchenko, “
          <article-title>Hybrid Encryption Model of AES and ElGamal Cryptosystems for Flight Control Systems”</article-title>
          , Oct.
          <year>2018</year>
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Damaševičius</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Napoli</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sidekerskienė</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Woźniak</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          (
          <year>2017</year>
          ).
          <article-title>IMF mode demixing in EMD for jitter analysis</article-title>
          .
          <source>Journal of Computational Science</source>
          ,
          <volume>22</volume>
          ,
          <fpage>240</fpage>
          -
          <lpage>252</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>