![\"\"](\"https:\/\/algebra.math-ugm.id\/wp-content\/uploads\/2025\/10\/WhatsApp-Image-2025-10-24-at-08.31.16-1024x1024.jpeg\")
<\/p>\n
From our laboratory, Dr. Uha Isnaini<\/strong> served as the keynote speaker at the parallel seminar on \u201cSafe Migration to Post-Quantum Cryptography (PQC)\u201d<\/strong>. Dr. Isnaini emphasized that the advent of quantum computing introduces new risks to traditional digital security frameworks, as quantum algorithms could potentially break many existing cryptographic standards. Post-Quantum Cryptography (PQC) aims to develop new algorithms that remain secure even in the presence of powerful quantum adversaries.<\/p>\n He discussed how PQC algorithms are mathematically structured, analyzed for efficiency, and implemented in practice<\/strong>, underscoring the importance of interoperability, system readiness, and international collaboration. Dr. Isnaini also called for a stronger connection between policy development and theoretical research<\/strong>, encouraging cooperation among academia, government, and industry to ensure Indonesia\u2019s safe migration toward post-quantum security.<\/p>\n Our laboratory was also represented by two student-led research presentations, reflecting the depth of ongoing mathematical and cryptographic work at Universitas Gadjah Mada. Authors:<\/strong> Abdul Hadi, Uha Isnaini, Erwin Eko Wahyudi, and Indah Emilia Wijayanti<\/p>\n This study introduced a novel RSA-like cryptosystem<\/strong> constructed over the ring of Eisenstein integers, extending the classical RSA framework into a richer algebraic structure. The research provided a rigorous analysis of prime classification, residue systems, quotient rings, and Euler\u2019s Totient function<\/strong> within the Eisenstein domain, offering both theoretical and practical significance. This innovative extension not only generalizes RSA but also contributes to post-quantum secure cryptographic designs<\/strong>, strengthening the algebraic foundation of modern public-key systems.<\/p>\n Authors:<\/strong> Annisa Dini Handayani, Indah Emilia Wijayanti, Uha Isnaini, and Prastudy Fauzi<\/p>\n This paper proposed two efficient multiparty key exchange (MPKE) protocols<\/strong> based on bilinear maps that improve both efficiency and security over existing schemes. The first protocol enables shared key generation among n<\/em> even users in n\u20132<\/em> rounds, while the second supports n<\/em> odd users in (n\u20131)\/2<\/em> rounds \u2014 both outperforming well-known models such as those of Ingemarsson et al. and Joux.<\/p>\n The authors established the security of their schemes under the Computational Diffie\u2013Hellman (CDH)<\/strong> and Computational Bilinear Diffie\u2013Hellman (CBDH)<\/strong> assumptions, ensuring robustness and computational soundness. Their results highlight the practicality and scalability of bilinear-based constructions for secure multi-user communication systems.<\/p>\n <\/p>","protected":false},"excerpt":{"rendered":" The 2025 IEEE 2nd International Conference on Cryptography, Informatics, and […]<\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-358","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/algebra.math-ugm.id\/en\/wp-json\/wp\/v2\/posts\/358","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/algebra.math-ugm.id\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/algebra.math-ugm.id\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/algebra.math-ugm.id\/en\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/algebra.math-ugm.id\/en\/wp-json\/wp\/v2\/comments?post=358"}],"version-history":[{"count":1,"href":"https:\/\/algebra.math-ugm.id\/en\/wp-json\/wp\/v2\/posts\/358\/revisions"}],"predecessor-version":[{"id":361,"href":"https:\/\/algebra.math-ugm.id\/en\/wp-json\/wp\/v2\/posts\/358\/revisions\/361"}],"wp:attachment":[{"href":"https:\/\/algebra.math-ugm.id\/en\/wp-json\/wp\/v2\/media?parent=358"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/algebra.math-ugm.id\/en\/wp-json\/wp\/v2\/categories?post=358"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/algebra.math-ugm.id\/en\/wp-json\/wp\/v2\/tags?post=358"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
His presentation, titled \u201cConnecting Policy and Theory: Unpacking the Foundations and Challenges of Post-Quantum Cryptography\u201d<\/em>, addressed both the theoretical and policy-level aspects of transitioning to quantum-resistant security systems.<\/p>\n
\nStudent Research Presentations<\/span><\/h3>\n
![\"\"](\"https:\/\/algebra.math-ugm.id\/wp-content\/uploads\/2025\/10\/WhatsApp-Image-2025-10-24-at-08.31.03-1024x768.jpeg\")
<\/p>\n1. An RSA-Like Scheme over Eisenstein Integers<\/h4>\n
By leveraging the Euclidean and quadratic unique factorization<\/strong> properties of Eisenstein integers, the authors developed a key generation method based on Eisenstein primes and implemented modular exponentiation adapted to this new setting.<\/p>\n2. Efficient and Secure Multiparty Key Exchange Schemes from Bilinear Maps<\/h4>\n