Honey Maze Encryption (Home)

Abstract

Current encryption schemes use n-bit key, where the security of the encryption increases with the size of the key. This scheme was considered secure but with enough computational power they are vulnerable to brute-force attacks. Honey encryption is a solution to conventional crypto-algorithms which are vulnerable to brute force. A cipher text that is honey-encrypted has the property that attempted decryptions with invalid keys yield valid-looking output messages. The proposed HONEY MAZE ENCRYPTION(HOME) makes honey encryption strong by asking security questions. If both the entered key and answered questions are True then a valid output is displayed else a valid fake output will be displayed. Thus, the attacker employing a brute-force approach, power computing gains no right information.

Keywords: Encryption; brute force; Computer security