Publication:
Secure hybrid mode-based cryptosystem

Simple item page
dc.citedby3
dc.contributor.authorIsmail E.S.en_US
dc.contributor.authorBaharudin S.en_US
dc.contributor.authorid10045432900en_US
dc.contributor.authorid55180778800en_US
dc.date.accessioned2023-12-29T07:47:34Z
dc.date.available2023-12-29T07:47:34Z
dc.date.issued2012
dc.description.abstractProblem 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.en_US
dc.description.natureFinalen_US
dc.identifier.doi10.3844/ajassp.2012.289.292
dc.identifier.epage292
dc.identifier.issue3
dc.identifier.scopus2-s2.0-84859590564
dc.identifier.spage289
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84859590564&doi=10.3844%2fajassp.2012.289.292&partnerID=40&md5=2896ccc20d1560ddd1273ef99e58b9bd
dc.identifier.urihttps://irepository.uniten.edu.my/handle/123456789/30412
dc.identifier.volume9
dc.pagecount3
dc.relation.ispartofAll Open Access; Hybrid Gold Open Access
dc.sourceScopus
dc.sourcetitleAmerican Journal of Applied Sciences
dc.subjectCryptography
dc.subjectCryptology
dc.subjectCryptosystem
dc.subjectHard problems
dc.titleSecure hybrid mode-based cryptosystemen_US
dc.typeArticleen_US
dspace.entity.typePublication
Files
Collections
SCOPUS