A secret sharing scheme involves dividing a confidential piece of information among multiple users, and a specific number of these users can work together to recover the original secret. In this article, we propose an innovative secret sharing scheme that is dynamic and hierarchical, relying on elliptic curves and pairings. The primary motivation for incorporating bilinear pairings with elliptic curves is to maintain a high level of security while reducing the key size, as seen in various existing schemes. The proposed scheme is computationally secure, efficient and verifiable. The time computation for the proposed scheme has been determined. We have included explicit examples using SageMath.
A multivariate polynomial $f$ is decomposable if $f$ is a composition $f=u\circ h$, where $u$ is a univariate polynomial of degree greater than one and $h$ is a multivariate polynomial. We consider the problem of computing the nearest...
Cancer is a major cause of mortality, yet the mechanisms governing its growth, progression, and elimination remain incompletely understood. Mathematical modeling not only clarifies these complex processes but also provides clinicians...
Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^{n} - 2^{k} + 1$,...
This work is devoted to the symbolic computation of centralizers of ordinary differential operators (ODOs), in the ring of differential operators. Starting with an operator $L$ of order $n$ and the order $\mathfrak{m}$ of a non-trivial...
In this work, we address the problem of expressing sequences of $d$-orthogonal polynomials in terms of either orthogonal polynomials or the canonical basis. We derive a general recurrence relation that enables the symbolic recursive...