Please use this identifier to cite or link to this item: http://ir.futminna.edu.ng:8080/jspui/handle/123456789/1764
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAdebayo, Olawale Surajudeen-
dc.contributor.authorOlalere, Morufu-
dc.contributor.authorMishra, Amit-
dc.contributor.authorUgwu, Joel N.-
dc.contributor.authorMabayoje, Modina A.-
dc.date.accessioned2021-06-06T17:02:11Z-
dc.date.available2021-06-06T17:02:11Z-
dc.date.issued2014-
dc.identifier.issn147-155-
dc.identifier.urihttp://repository.futminna.edu.ng:8080/jspui/handle/123456789/1764-
dc.description.abstractSecurity of information cannot be perfectly realized as both it and its counter technology continue to evolve. In the same vein, using a single cryptographic cipher to realize information secrecy is not enough as it can be broken over time, thus revealing the information in plaintext. Most of the existing cryptographic ciphers possess a minimal level of weakness, which is exploitable over time, but when this algorithmic transformation is used in multiple times, the number of trials, effort, and time required to exploit it become greater. This paper proposes a multilevel algorithm for realizing the security of information using a multiple-cryptographic ciphers process. It presents the possibility of combining n- cryptographic ciphers in a single implementation within the system, permitting n-cryptographic transformation to take place during the encryption and decryption processesen_US
dc.language.isoenen_US
dc.publisherTransactions on Networks and Communicationsen_US
dc.relation.ispartofseriesVolume 2;5-
dc.subjectCryptographyen_US
dc.subjectEncryption, , , ,en_US
dc.subjectn-cryptographic algorithmsen_US
dc.subjectCryptanalysisen_US
dc.subjectMultilevel Algorithmen_US
dc.titleN-Cryptographic Multilevel Algorithm for Effective Information Securityen_US
dc.typeArticleen_US
Appears in Collections:Cyber Security Science

Files in This Item:
File Description SizeFormat 
TCN 504-1550-1-PB.pdf746.93 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.