A Robust Cryptographic System using Neighborhood-Generated Keys
Samuel King Opoku (Kumasi Polytechnic)

TL;DR
This paper introduces a robust cryptographic system that generates keys from the environment and existing coding schemes, aiming to reduce storage and processing requirements while maintaining security.
Contribution
It presents a novel key generation method based on surroundings and pre-existing codes, enhancing efficiency and security in cryptographic systems.
Findings
Conserves storage space in encryption processes
Reduces processing power needed for encryption
Successfully implemented using PHP and MySQL
Abstract
The ability to hide information from unauthorized individuals has been a prevalent issue over the years. Countless algorithms such as DES, AES and SHA have been developed. These algorithms depend on varying key length and key management strategies to encrypt and decrypt messages. The size of the encrypted message is so large that it therefore consumes and wastes valuable storage space when implemented in organizations that store and handle large volumes of small data. The ability to share the generated keys securely also poses a problem. This paper proposes a robust cryptographic algorithm which generates its keys from the surroundings and already-designed coding schemes. The proposed system conserves storage space and processing power.The algorithm is implemented and tested using PHP and MySQL DBMS.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
