The 2025 IEEE 2nd International Conference on Cryptography, Informatics, and Cybersecurity (ICoCICs 2025) brought together researchers and experts from around the world to discuss the rapidly evolving challenges in cryptography and cybersecurity. The central theme of this year’s conference — “The Future of Cryptography and Cybersecurity in the Age of Quantum Computing: AI vs Quantum Threats” — explored the intersection between artificial intelligence, quantum computing, and the future of secure digital communication.
From our laboratory, Dr. Uha Isnaini served as the keynote speaker at the parallel seminar on “Safe Migration to Post-Quantum Cryptography (PQC)”.
His presentation, titled “Connecting Policy and Theory: Unpacking the Foundations and Challenges of Post-Quantum Cryptography”, addressed both the theoretical and policy-level aspects of transitioning to quantum-resistant security systems.
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.
He discussed how PQC algorithms are mathematically structured, analyzed for efficiency, and implemented in practice, underscoring the importance of interoperability, system readiness, and international collaboration. Dr. Isnaini also called for a stronger connection between policy development and theoretical research, encouraging cooperation among academia, government, and industry to ensure Indonesia’s safe migration toward post-quantum security.
Student Research Presentations
Our laboratory was also represented by two student-led research presentations, reflecting the depth of ongoing mathematical and cryptographic work at Universitas Gadjah Mada.
1. An RSA-Like Scheme over Eisenstein Integers
Authors: Abdul Hadi, Uha Isnaini, Erwin Eko Wahyudi, and Indah Emilia Wijayanti
This study introduced a novel RSA-like cryptosystem constructed over the ring of Eisenstein integers, extending the classical RSA framework into a richer algebraic structure.
By leveraging the Euclidean and quadratic unique factorization properties of Eisenstein integers, the authors developed a key generation method based on Eisenstein primes and implemented modular exponentiation adapted to this new setting.
The research provided a rigorous analysis of prime classification, residue systems, quotient rings, and Euler’s Totient function 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, strengthening the algebraic foundation of modern public-key systems.
2. Efficient and Secure Multiparty Key Exchange Schemes from Bilinear Maps
Authors: Annisa Dini Handayani, Indah Emilia Wijayanti, Uha Isnaini, and Prastudy Fauzi
This paper proposed two efficient multiparty key exchange (MPKE) protocols based on bilinear maps that improve both efficiency and security over existing schemes. The first protocol enables shared key generation among n even users in n–2 rounds, while the second supports n odd users in (n–1)/2 rounds — both outperforming well-known models such as those of Ingemarsson et al. and Joux.
The authors established the security of their schemes under the Computational Diffie–Hellman (CDH) and Computational Bilinear Diffie–Hellman (CBDH) assumptions, ensuring robustness and computational soundness. Their results highlight the practicality and scalability of bilinear-based constructions for secure multi-user communication systems.