Publication:
Randomness analysis on rectangle block cipher

Simple item page
dc.contributor.authorZakaria A.A.en_US
dc.contributor.authorAzni A.H.en_US
dc.contributor.authorRidzuan F.en_US
dc.contributor.authorZakaria N.H.en_US
dc.contributor.authorDaud M.en_US
dc.date.accessioned2024-05-29T02:07:24Z
dc.date.available2024-05-29T02:07:24Z
dc.date.issued2020
dc.description.abstractIn this paper, we analyze the randomness of the RECTANGLE cipher. RECTANGLE is a lightweight block cipher with 64-bit block size and variants key lengths of 80 and 128 bits. Lightweight block cipher requires less computing power than a block cipher algorithm which makes it more efficient to be implemented in low-resource devices. Randomness is an important property of a cryptography algorithm to make sure the output has no message pattern. The randomness testing was performed using the NIST Statistical Test Suite. A total of nine data categories were applied to generate 1,000 input sequences for each algorithm. RECTANGLE-80 and RECTANGLE-128 passed 98.73% and 98.48% of the randomness tests. Our analysis shows that both RECTANGLE variants seem to be non-random based on the 0.1% significance level. The experimental results from this paper identified some weaknesses that can be addressed in future research. � 2020 ACM.
dc.identifier.epage142
dc.identifier.scopus2-s2.0-85092671263
dc.identifier.spage133
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85092671263&partnerID=40&md5=62b87c584ca6118072f4290d785f5f57
dc.identifier.urihttps://oarep.usim.edu.my/handle/123456789/10394
dc.languageEnglish
dc.language.isoen_US
dc.publisherInstitute for Mathematical Research (INSPEM)en_US
dc.relation.ispartofAfkar
dc.sourceScopus
dc.subjectBlock cipheren_US
dc.subjectCryptographyen_US
dc.subjectLightweighten_US
dc.subjectRandomnessen_US
dc.subjectRECTANGLEen_US
dc.subjectStatistical testen_US
dc.titleRandomness analysis on rectangle block cipher
dc.typeConference Paperen_US
dspace.entity.typePublication

Files

Collections

Scopus