Let p be a prime ≡ 1 (mod 7). In this paper, we obtain an explicit expression for a primitive seventh root of unity ( mod p) in terms of coefficients of a Jacobi sum of order 7 and also in terms of a solution of a Diophantine system of Leonard and Williams, and then obtain Euler's criterion for septic nonresidues D ( mod p) in terms of this seventh root. Explicit results are given for septic nonresidues for D = 2, 3, 5, 7.
In this paper, we have proposed a modified cryptographic scheme based on the application of recursive matrices as key in ECC and ElGamal. For encryption, we consider mapping analogous to affine Hill cipher in which a plaintext matrix has been constructed by points corresponding to letters on elliptic curves. In the formation of key-space, the generalized Fibonacci matrices have been taken into account, which is the sequence of matrices. The beauty of considering Fibonacci matrices is their construction where we need only two parameters(integers) in place of n 2 elements. The use of a recursive matrix makes a large keyspace for our proposed scheme and increases its efficiency. Thus, it reduces time as well space complexity, and its security & strength is based on EC-DLP which is a hard problem in number theory.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.