Abstract

Because encryption is a fundamental security building block, existing encryption techniques like AES, Twofish, Blowfish, and Triple DES are constantly under the threat of being compromised. We introduce a simple graph-theoretic encryption method named CryptoCliqIn using clique injection and prove that the decryption of this encryption without the appropriate key is #P-complete. We have shown that the proposed model does not introduce delays in encryption and decryption times and provides a more secure mechanism compared to some of the existing encryption mechanisms. Finally, an adaptation of CryptoCliqIn in an intelligent system is discussed under the setup of intelligent and smart building.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.