Abstract
Cryptography is the process of transforming data so that only the recipient of the message can read it. It uses an algorithm and a key to convert an input into an encrypted output. In this study, we introduce a novel method for protecting readable messages through the utilization of a polynomial root-finding technique in conjunction with the decimated output of Zaslavsky equations. The innovative approach we have developed is a block encryption algorithm that offers both protection for sensitive information as well as adaptability to various block sizes, including dynamically changing block sizes. Precise security analysis is provided for the proposed algorithm using key space analysis and strong statistical tests. The presented results show that the novel block encryption protection provides a high level of security.
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 callDisclaimer: 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.
