A NOVEL ENCRYPTION AND DECRYPTION SCHEMEFOR DIGITAL SIGNALS USING BERNSTEIN POLYNOMIALS.

Authors

  • Omar M. Barukab & S. H. Behiry

Keywords:

Bernstein polynomial, encryption, decryption, nonsingular matrix, invertible matrix, Moore machine

Abstract

The security of communications and electronic commerce in the digital era relies heavily on the modern incarnation of the ancient art of code and different forms of ciphers. Mathematics play the main rule in this realm. In this paper, a novel encryption scheme is proposed. It is mainly based on the usage of long key size and the incorporation of recurrence relations in conjunction with Moore finite state machine. In addition, the usage of Bernstein polynomial in accomplishing the encryption and decryption represents an additional layer of security to the proposed encryption scheme.

Downloads

Published

2017-03-30

How to Cite

Omar M. Barukab & S. H. Behiry. (2017). A NOVEL ENCRYPTION AND DECRYPTION SCHEMEFOR DIGITAL SIGNALS USING BERNSTEIN POLYNOMIALS. International Journal of Research Science and Management, 4(4), 23–31. Retrieved from http://ijrsm.com/index.php/journal-ijrsm/article/view/414

Issue

Section

Articles