CRYPTOGRAPHIC APPROACH TO ENHANCING COMPUTER-BASED TEST SECURITY: EXAMINATION NUMBER GENERATION AND AUTHENTICATION SCHEME

Over the past decades, authors have created multiple question papers in Computer-Based Tests (CBT) by adopting Fisher-Yate’s, Sattolo’s and key-word based shuffling algorithms without indicating access procedure to the question papers. In this research, an Examination Number Generation and Authentication Scheme (ENGAS) is proposed which is a novel approach to CBT security that generates a large number of batches of examination numbers using asymmetric cryptographic schemes to provide secure and automated question Paper assembly. During design, cryptographic and complexity management algorithms were harnessed to determine the scheme’s functionality and performance. Next, a high-level algorithm of the scheme was developed using Greedy, recursive and Divide-and-Conquer algorithm development approaches. Lastly, the developed algorithms were simulated and integrated to a CBT using ASP.NET Core, Entity Framework and SQL Server 2014. Coverage testing based on the required functionalities and security level determination indicated that ENGAS was well consolidated with leptokurtic cryptographic features distribution for secure question paper assembly, scalable to meet extreme population increase and capable of eliminating the use of proxy and question paper personalization.

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2024-11-04
DOI
https://doi.org/10.5281/zenodo.14019369
Primary Topic
Neural and Behavioral Psychology Studies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CRYPTOGRAPHIC APPROACH TO ENHANCING COMPUTER-BASED TEST SECURITY: EXAMINATION NUMBER GENERATION AND AUTHENTICATION SCHEME

Zenodo (CERN European Organization for Nuclear Research)
Neural and Behavioral Psychology Studies
article

CRYPTOGRAPHIC APPROACH TO ENHANCING COMPUTER-BASED TEST SECURITY: EXAMINATION NUMBER GENERATION AND AUTHENTICATION SCHEME

article en

Abstract

Over the past decades, authors have created multiple question papers in Computer-Based Tests (CBT) by adopting Fisher-Yate’s, Sattolo’s and key-word based shuffling algorithms without indicating access procedure to the question papers. In this research, an Examination Number Generation and Authentication Scheme (ENGAS) is proposed which is a novel approach to CBT security that generates a large number of batches of examination numbers using asymmetric cryptographic schemes to provide secure and automated question Paper assembly. During design, cryptographic and complexity management algorithms were harnessed to determine the scheme’s functionality and performance. Next, a high-level algorithm of the scheme was developed using Greedy, recursive and Divide-and-Conquer algorithm development approaches. Lastly, the developed algorithms were simulated and integrated to a CBT using ASP.NET Core, Entity Framework and SQL Server 2014. Coverage testing based on the required functionalities and security level determination indicated that ENGAS was well consolidated with leptokurtic cryptographic features distribution for secure question paper assembly, scalable to meet extreme population increase and capable of eliminating the use of proxy and question paper personalization.

Zenodo (CERN European Organization for Nuclear Research)
Bells University of Technology (NG), University of Science and Technology of Benin (BJ)
Openalex Percentile: Top 59%
Neural and Behavioral Psychology Studies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.