A Robust Cryptographic System using Neighborhood-Generated Keys
This addresses storage and efficiency issues for organizations handling large volumes of small data, but appears incremental as it builds on existing cryptographic methods.
The paper tackles the problem of large encrypted message sizes and secure key sharing in cryptography by proposing a new algorithm that generates keys from surroundings and existing coding schemes, resulting in conservation of storage space and processing power.
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.