Staff View: Secure hybrid mode-based cryptosystem

Secure hybrid mode-based cryptosystem

Problem statement: A cryptosystem provides two parties; a sender and a receiver to communicate interactively via an insecure channel in which, the sender is able to send any confidential message, document or data in a disguised form to the intended receiver. Upon receiving the disguised message, the...

Full description

Saved in:

Bibliographic Details
Main Authors:	Ismail E.S., Baharudin S.
Other Authors:	10045432900
Format:	Article
Published:	2023
Subjects:	Cryptography Cryptology Cryptosystem Hard problems
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my.uniten.dspace-30412
record_format	dspace
spelling	my.uniten.dspace-304122023-12-29T15:47:34Z Secure hybrid mode-based cryptosystem Ismail E.S. Baharudin S. 10045432900 55180778800 Cryptography Cryptology Cryptosystem Hard problems Problem statement: A cryptosystem provides two parties; a sender and a receiver to communicate interactively via an insecure channel in which, the sender is able to send any confidential message, document or data in a disguised form to the intended receiver. Upon receiving the disguised message, the receiver converts it to the intelligible message using his secret key. The security of the existing cryptosystems was based on a single hard problem such as factorization, discrete logarithm, quadratic residue, or elliptic curve discrete logarithm. Although these schemes appear secure, one day in a near future they may be broken if one finds a solution of a single hard problem. Approach: To overcome the disadvantage of using a single hard problem, we developed a secure hybrid mode-based cryptosystem based on the two well-known hard problems; factoring and discrete logarithm. We inject the element of the hard problems into our encrypting and decrypting equations respectively in such a way that the former equation depends on two public keys whereas the latter depends on two corresponding secret keys. Results: The new cryptosystem is shown heuristically secure against various algebraic attacks. The efficiency analysis confirms that our scheme only needs 3T exp+T hash time complexity for encryption and 2 Texp time complexity for decryption and this magnitude of complexity is considered minimal for multiple hard problems-like cryptosystems. Conclusion: The newly developed hybrid mode based-cryptosystem provides greater security level than that schemes based on a single hard problem. The enemy or adversary has to solve the two problems simultaneously which is unlikely to happen in order to read any secret message. � 2012 Science Publications. Final 2023-12-29T07:47:34Z 2023-12-29T07:47:34Z 2012 Article 10.3844/ajassp.2012.289.292 2-s2.0-84859590564 https://www.scopus.com/inward/record.uri?eid=2-s2.0-84859590564&doi=10.3844%2fajassp.2012.289.292&partnerID=40&md5=2896ccc20d1560ddd1273ef99e58b9bd https://irepository.uniten.edu.my/handle/123456789/30412 9 3 289 292 All Open Access; Hybrid Gold Open Access Scopus
institution	Universiti Tenaga Nasional
building	UNITEN Library
collection	Institutional Repository
continent	Asia
country	Malaysia
content_provider	Universiti Tenaga Nasional
content_source	UNITEN Institutional Repository
url_provider	http://dspace.uniten.edu.my/
topic	Cryptography Cryptology Cryptosystem Hard problems
spellingShingle	Cryptography Cryptology Cryptosystem Hard problems Ismail E.S. Baharudin S. Secure hybrid mode-based cryptosystem
description	Problem statement: A cryptosystem provides two parties; a sender and a receiver to communicate interactively via an insecure channel in which, the sender is able to send any confidential message, document or data in a disguised form to the intended receiver. Upon receiving the disguised message, the receiver converts it to the intelligible message using his secret key. The security of the existing cryptosystems was based on a single hard problem such as factorization, discrete logarithm, quadratic residue, or elliptic curve discrete logarithm. Although these schemes appear secure, one day in a near future they may be broken if one finds a solution of a single hard problem. Approach: To overcome the disadvantage of using a single hard problem, we developed a secure hybrid mode-based cryptosystem based on the two well-known hard problems; factoring and discrete logarithm. We inject the element of the hard problems into our encrypting and decrypting equations respectively in such a way that the former equation depends on two public keys whereas the latter depends on two corresponding secret keys. Results: The new cryptosystem is shown heuristically secure against various algebraic attacks. The efficiency analysis confirms that our scheme only needs 3T exp+T hash time complexity for encryption and 2 Texp time complexity for decryption and this magnitude of complexity is considered minimal for multiple hard problems-like cryptosystems. Conclusion: The newly developed hybrid mode based-cryptosystem provides greater security level than that schemes based on a single hard problem. The enemy or adversary has to solve the two problems simultaneously which is unlikely to happen in order to read any secret message. � 2012 Science Publications.
author2	10045432900
author_facet	10045432900 Ismail E.S. Baharudin S.
format	Article
author	Ismail E.S. Baharudin S.
author_sort	Ismail E.S.
title	Secure hybrid mode-based cryptosystem
title_short	Secure hybrid mode-based cryptosystem
title_full	Secure hybrid mode-based cryptosystem
title_fullStr	Secure hybrid mode-based cryptosystem
title_full_unstemmed	Secure hybrid mode-based cryptosystem
title_sort	secure hybrid mode-based cryptosystem
publishDate	2023
_version_	1806427375589654528
score	13.222552

Secure hybrid mode-based cryptosystem

Similar Items