<?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-2436</article-id>
      <title-group>
        <article-title>Utilizing infinite-dimensional Hamiltonian systems for advanced cryptographic methods</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Jujare</surname>
            <given-names>Varsha Anup</given-names>
          </name>
          <aff>Department of Computer Science and Engineering, Sharad Institute of Technology College of Engineering, Ichalkaranji, Maharashtra, 416115, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Dommari</surname>
            <given-names>Sandeep</given-names>
          </name>
          <aff>Prosper, Texas, 75078, United States</aff>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Nanche</surname>
            <given-names>Bhushan Marutirao</given-names>
          </name>
          <aff>Department of Information Technology, Akurdi, D Y Patil College of Engineering, Pune, Maharashtra, 411044, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Tiwari</surname>
            <given-names>Sudhakar</given-names>
          </name>
          <aff>Schaumburg, Illinois, 60195, United States</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Dass</surname>
            <given-names>Pranav</given-names>
          </name>
          <aff>Department of Computer Science, Shyam Lal College, University of Delhi, Delhi, 110032, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Ahire</surname>
            <given-names>Pallavi Pankaj</given-names>
          </name>
          <aff>Department of Computer Science and Engineering, Pimpri Chinchwad University, Pune, Maharashtra, 412106, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Patil</surname>
            <given-names>Rajendra V.</given-names>
          </name>
          <aff>Department of Computer Engineering, SSVPS Bapusaheb Shivajirao Deore College of Engineering, Dhule, Maharashtra, 424002, India</aff>
        </contrib>
      </contrib-group>
      <volume>28</volume>
      <issue>5-B</issue>
      <fpage>2209</fpage>
      <lpage>2217</lpage>
      <pub-date date-type="pub">
        <day>30</day>
        <month>08</month>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>The paper looks at how infinite-dimensional Hamiltonian systems can be used to create more advanced encryption methods. We suggest new encryption algorithms that make things safer by making them more complicated and harder to guess. These algorithms take advantage of the complex and changing nature of these systems. endless-dimensional Hamiltonian systems are great for cryptography because they have a lot of benefits. These systems have an endless number of degrees of freedom and very complicated phase space structures. Traditional cryptoanalytic attacks can’t break these systems because they can make highly entropic keys and complex changes. In addition, Hamiltonian mechanics is a solid mathematical theory that can be used to study and prove the security features of the suggested cryptography methods. The goal of this study is to find a link between abstract mathematical theories and real-world encryption solutions. This will create new ways for people to safely communicate in a digital world that is becoming more and more linked. The suggested methods are tested to see how well they work with computers and how well they protect against different types of attacks. This shows that they could be used in the real world.</p>
      </abstract>
      <kwd-group>
        <kwd>Infinite-dimensional hamiltonian systems</kwd>
        <kwd>Encryption algorithms</kwd>
        <kwd>Computational security</kwd>
        <kwd>Mathematical cryptanalysis</kwd>
        <kwd>Key generation</kwd>
        <kwd>Secure communication</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>
