<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-discrete-mathematical-sciences-and-cryptography</journal-id>
      <journal-title-group>
        <journal-title>Journal of Discrete Mathematical Sciences and Cryptography</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-0065</issn>
      <issn publication-format="print">0972-0529</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JDMSC-3050</article-id>
      <title-group>
        <article-title>Matrix group representations in cryptographic transformations</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Thanekar</surname>
            <given-names>Sachin Arun</given-names>
          </name>
          <aff>Department of Information Technology, Sanjeevani College of Engineering, Kopargaon, Maharashtra, 423603, India</aff>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Anekar</surname>
            <given-names>Devata R.</given-names>
          </name>
          <aff>Department of Information Technology, Vishwakarma Institute of Technology, Pune, Maharashtra, 411037, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Suryawanshi</surname>
            <given-names>Ranjeetsingh</given-names>
          </name>
          <aff>Department of Computer Engineering, Viswakarma Institute of Technology, Savitribai Phule Pune University, Pune, Maharashtra, 411037, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Nawathe</surname>
            <given-names>Anuradha Narendra</given-names>
          </name>
          <aff>Department of Information Technology, Amrut Vahini College of Engineering, Sangamner, Maharashtra, 422608, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Shepal</surname>
            <given-names>Yogesh</given-names>
          </name>
          <aff>Department of Computer Science &amp; Engineering, ASM’s Nextgen Technical Campus, Pune, Maharashtra, 410506, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Kavitha</surname>
            <given-names>G.</given-names>
          </name>
          <aff>Department of Mechanical Engineering, PCET’s Nutan Maharashtra Institute of Engineering &amp; Technology, Pune, Maharashtra, 410507, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Gulhane</surname>
            <given-names>Monali</given-names>
          </name>
          <aff>Department of Computer Science &amp; Engineering, Nagpur Campus, Symbiosis International (Deemed University), Symbiosis Institute of Technology, Pune, Maharashtra, 440008, India</aff>
        </contrib>
      </contrib-group>
      <volume>29</volume>
      <issue>10-B</issue>
      <fpage>4273</fpage>
      <lpage>4288</lpage>
      <pub-date date-type="pub">
        <day>31</day>
        <month>10</month>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>The growing need of safe data transmission in the contemporary digital setting, such as cloud-based, Internet of Things (IoT), and distributed systems, has revealed the weaknesses of the traditional cryptography methods, especially in the form of new quantum threats. Traditional approaches founded on number-theoretic conjectures are now facing challenges, and more multifaceted and scalable mathematical theories need to be pursued. This work tackles this problem by suggesting a new cryptographic transformation model that is based on matrix group representations, which are defined on finite fields. The main aim of the work is to construct a mathematically sound and implementation-friendly encryption scheme that increases the security level by high-dimensional, non-commutative transformations. The methodology consists of a representation mapping of plaintext data in the form of vectors and a series of reversible matrix transformations, based on group elements. The system combines the process of key generation, encryption, and decryption in one algebraic framework and is executed in Python (NumPy, SciPy) and MATLAB to perform efficient operations on matrices. The reported experimental results indicate ciphertext entropy of 7.98 bits per byte and an avalanche effect of 52.6%, compared with 7.95 bits and 50.1%, respectively, for the AES baseline. These preliminary findings suggest favorable statistical randomness and diffusion characteristics, although reproducibility requires further documentation of the experimental protocol and independent validation of the reported measurements. Comparative analysis to AES indicates that the proposed scheme has a slightly higher computational overhead, but provides a better key space, structural complexity, and resistance to attacks. Scalability tests ensure that the system works effectively with a moderate size of matrices as well as various data sets, such as text and picture data. Overall, the proposed framework provides safe, scalable and versatile solution to next generation cryptography usage, particularly high security and post-quantum settings.</p>
      </abstract>
      <kwd-group>
        <kwd>Matrix group representations</kwd>
        <kwd>Cryptographic transformations</kwd>
        <kwd>Finite fields</kwd>
        <kwd>Non-commutative algebra</kwd>
        <kwd>Encryption and decryption</kwd>
        <kwd>Representation theory</kwd>
      </kwd-group>
      <custom-meta-group>
        <custom-meta>
          <meta-name>access</meta-name>
          <meta-value>open</meta-value>
        </custom-meta>
        <custom-meta>
          <meta-name>retracted</meta-name>
          <meta-value>no</meta-value>
        </custom-meta>
      </custom-meta-group>
    </article-meta>
  </front>
</article>
