Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Pushp, Sumant"'
In this article, we propose a method to construct self orthogonal matrix, orthogonal matrix and anti orthogonal matrix over the finite field. Orthogonal matrices has numerous applications in cryptography, so here we demonstrate the application of wei
Externí odkaz:
http://arxiv.org/abs/2005.14649
Morphological analyzers are the essential milestones for many linguistic applications like; machine translation, word sense disambiguation, spells checkers, and search engines etc. Therefore, development of an effective morphological analyzer has a g
Externí odkaz:
http://arxiv.org/abs/2003.00234
In the era of intelligent computing, computational progress in text processing is an essential consideration. Many systems have been developed to process text over different languages. Though, there is considerable development, they still lack in und
Externí odkaz:
http://arxiv.org/abs/2002.10665
In this paper, we present the fast computational algorithms for the Jacobi sums of orders $l^2$ and $2l^{2}$ with odd prime $l$ by formulating them in terms of the minimum number of cyclotomic numbers of the corresponding orders. We also implement tw
Externí odkaz:
http://arxiv.org/abs/1908.04263
Confidentiality and Integrity are two paramount objectives in the evaluation of information and communication technology. In this paper, we propose an arithmetic approach for designing asymmetric key cryptography. Our method is based on the formulati
Externí odkaz:
http://arxiv.org/abs/1906.06921
Publikováno v:
In Cognitive Systems Research June 2018 49:114-127
Publikováno v:
Indian Journal of Pure & Applied Mathematics; Jun2023, Vol. 54 Issue 2, p330-343, 14p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.