Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Poojary, P."

Filter results by typing the first few letters
Now showing 1 - 3 of 3
  • Results Per Page
  • Sort Options
  • No Thumbnail Available
    Item
    R-ORTHOGONALITY OF LATIN SQUARES USING BIVARIATE PERMUTATION POLYNOMIALS
    (Jangjeon Research Institute for Mathematical Sciences and Physics, 2022) Bhatta, G.R.; Shankar, B.R.; Poojary, P.
    Cryptographic applications of Latin squares require to study them in various aspects. In this paper, the formation and observation of Latin squares using bivariate permutation polynomials over some finite rings are established with respect to their properties like self orthogonalization, r-orthogonalization, and r-mirror orthogonalization. We also identified why some particular cases fail to form self orthogonal Latin squares, and we illustrate it by giving examples. © 2022 Jangjeon Research Institute for Mathematical Sciences and Physics. All rights reserved.
  • No Thumbnail Available
    Item
    Sequences of numbers via permutation polynomials over some finite rings
    (Universidad Catolica del Norte, 2020) Bhatta, G.R.V.; Shankar, B.R.; Mishra, V.N.; Poojary, P.
    A polynomial can represent every function from a finite field to itself. The functions which are also permutations of the field give rise to permutation polynomials, which have potential applications in cryptology and coding theory. Permutation polynomials over finite rings are studied with respect to the sequences they generate. The sequences obtained through some permutation polynomials are tested for randomness by carrying out known statistical tests. Random number generation plays a major role in cryptography and hence permutation polynomials may be used as random number generators. © 2020. All rights reserved.
  • No Thumbnail Available
    Item
    Variations of diagonal cyclicity of Latin squares formed by permutation polynomials
    (Forum-Editrice Universitaria Udinese SRL, 2021) Bhatta, V.G.R.; Shankar, B.R.; Poojary, P.; Manasa, K.J.; Mishra, V.N.
    Cryptographic applications of Latin squares require to study them in various aspects. The Latin squares, which are due to bivariate polynomials, show some interesting patterns of entries. In this paper, we discussed the diagonally cyclic nature of Latin squares over some small finite rings with the help of the bivariate permutation polynomials, which formed them. © 2021 Forum-Editrice Universitaria Udinese SRL. All rights reserved.

Maintained by Central Library NITK | DSpace software copyright © 2002-2026 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify