Open Access
Research Article
FEDQIM : Fast easy decentralized quantum-proof instant messenger
*D. R. Denslin BrabinCorresponding authordenscse@gmail.comDepartment of Computer Science and Engineering DMI College of Engineering Chennai, Tamil Nadu, 600123, India0000-0002-4377-0617View full profile → , W. Agithaajithajerry@gmail.comDepartment of Computer Science and Engineering DMI College of Engineering Chennai, Tamil Nadu, 600123, IndiaView full profile → , K. Kalai Kumarkalaikumar23@gmail.comDepartment of Computer Science and Engineering DMI College of Engineering Chennai, Tamil Nadu, 600123, IndiaView full profile → , P. Swarna Lakshmiswarnarp@gmail.comDepartment of Computer Science and Engineering DMI College of Engineering Chennai, Tamil Nadu, 600123, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 11 Sep 2024
- Published Online:
- 01 Jan 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIOS-1974
- Pages:
- 273–286
Abstract
Instant messengers can be used to exchange messages across different platforms like Android, IOS, Linux, Windows and MacOS. In this paper, an instant messenger called as Fedqim is proposed which is a fast, easy to use, decentralized and Quantum-Proof. It enables anyone to host their own instance of Fedqim and connect with other Fedqim users. The network is secured using the Fedqim Cryptographic Protocol. The Fedqim Cryptographic Protocol is inspired by Signal Cryptographic Protocol which is used in Whatsapp and Facebook. But unlike the original protocol, Fedqim Protocol is Decentralized and Quantum Proof public-key cryptosystem. Fedqim’s primary focus is user privacy and security. Fedqim ensures that a user is never associated with their real identity like a Phone Number or E-Mail, that means no metadata is leaked.
Keywords
Subject Classifications
Primary 68M12Secondary 81P45
References
[1] M. Marlinspike and T. Perrin, “The X3DH Key Agreement Protocol,” Signal Blog. (Nov. 2016), https://signal.org/docs/specifications/x3dh/x3dh.pdf [2] T. Perrin and M. Marlinspike, “The Double Ratcheting Algorithm,” Signal Blog. (Nov. 2016), https://signal.org/docs/specifications/doubleratchet/doubleratchet.pdf [3] P. W. Shor, “Polynomial-time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer,” SIAM ournal of Computing, vol. 26, no. 5, pp. 1484-1509 (1997), doi: 10.1137/S0097539795293172.[4] S. Micali, M. Rabiny and S. Vadhan, “Verifiable Random Functions,” in Proceedings of 40th Annual Symposium on Foundations of Computer Science, pp. 120-130 (Oct. 1999), doi: 10.1109/SFFCS.1999.814584.[5] Y. Dodis and A. Yampolskiy, “A Verifiable Random Function with Short Proofs and Keys,” Lecture Notes in Computer Science, vol. 3386, pp. 416–431 (2005), doi: 10.1007/978-3-540-30580-4_28.[6] N. Borisov, I. Goldberg, and E. Brewer, “Off-the-record Communication, or, Why not to use PGP,” in Proceedings of ACM Workshop on Privacy in the Electronic Society, pp. 77-84 (Oct. 2004), doi: 10.1145/1029179.1029200.[7] D. J. Bernstein, N. Duif, T. Lange, P. Schwabe and B. -Y. Yang, “High-speed High-security Signatures,” Journal of Cryptographic Engineering, vol. 2, pp. 77-89 (2012), doi: 10.1007/s13389-012-0027-1.[8] A. Langley, M. Hamburg and S. Turner, “Elliptic Curves for Security,” Internet Engineering Task Force; RFC Informational (2016), http://www.ietf.org/rfc/rfc7748.txt.[9] J. Alwen, S. Coretti and Y. Dodis, “The Double Ratchet: Security Notions, Proofs, and Modularization for the Signal Protocol,” in Advances in Cryptology, Lecture Notes in Computer Science, vol. 11476 (2019), doi: 10.1007/978-3-030-17653-2_5.[10] N. Unger, S. Dechand, J. Bonneau, S. Fahl, H. Perl, I. Goldberg and M. Smith, “Sok: Secure Messaging,” in IEEE Symposium on Security and Privacy, pp. 232-249 (2015), doi: 10.1109/SP.2015.22.[11] F. De Santis, A. Schauer and G. Sigl, “Chacha20-poly1305 Authenticated Encryption for High-speed Embedded IoT Applications,” in Design, Automation Test in Europe Conference & Exhibition, pp. 692-697 (2017), doi: 10.23919/DATE.2017.7927078.[12] T. Pornin, “New Efficient, Constant-Time Implementations of Falcon,” in IACR Cryptology ePrint Archive, 2019/893 (2019), https://ia.cr/2019/893.[13] A. Faz-Hernández, J. López and R. Dahab, “High-performance Implementation of Elliptic Curve Cryptography using Vector Instructions,” ACM Transactions on Mathematical Software, vol. 45, no. 3, Art. no. 25, pp. 1-35 (2019), doi: 10.1145/3309759.[14] H. Seo, P. Sanal, A. Jalali and R. Azarderakhsh, “Optimized implementation of sike round 2 on 64-bit arm cortex-a processors,” IEEE Transactions on Circuits and Systems, vol. 67, no. 8, pp. 2659–2671 (2020), doi: 10.1109/TCSI.2020. 2979410.[15] J. O’Connor, J. P. Aumasson, S. Neves and Z. Wilcox-O’Hearn, “Blake3: One Function, Fast Everywhere,” (2022), https://raw.githubusercontent.com/BLAKE3-team/BLAKE3-specs/master/blake3.pdf.[16] Riddhi Somaiya, Atul Gonsai, Rashmin Tanna “Implementation and evaluation of EMAES –A hybrid encryption algorithm for sharing multimedia files with more security and speed”, International Journal of Electrical and Computer Engineering Systems, vol. 14, no. 6, pp. 401-409 (2023), doi: 10.32985/ijeces.14.4.4.[17] A. Yildizhan and N. Topaloglu, “Chaotic Encryption and Privilege Based Visual Secret Sharing Model for Color Images,” Computing and Informatics, vol. 38, no. 3, pp. 701–727 (2019), doi: 10.31577/cai.2019.3.701[18] D. R. Denslin Braja and V. S. Dharun, “Identification of Person or Data using Modified Square Blockwise Approach,” International Journal of Reasoning-based Intelligent Systems, vol. 11, no. 2, pp. 103-108 (2019), doi: 10.1504/ IJRIS.2019.099845.[19] Peng Li, Jianfeng Ma, Liping Yin and Quan Ma, “A Construction Method of (2, 3) Visual Cryptography Scheme,” IEEE Access, vol. 8, pp. 32840-32849 (2020), doi: 10.1109/ACCESS.2020.2973659.[20] S. Dhawan, C. Chakraborty, J. Frnda, R. Gupta, Rana Ak and Pani SK. “SSII: secured and high-quality steganography using intelligent hybrid optimization algorithms for IoT,” IEEE Access. vol. 9, pp. 87563- 87578 (2021), doi: 10.1109/ACCESS.2021.3089357.[21] G. Peter, A. Sherine, Y. Teekaraman, R. Kuppusamy and A. Radhakrishnan, “Histogram shifting-based quick response steganography method for secure communication,” Wireless Communications and Mobile Computing, Art. no. 1505133 (2022), doi: 10.1155/2022/1505133.[22] D. R. Denslin Brabin, Christo Ananth and Sriramulu Bojjagani, “Blockchain based security framework for sharing digital images using reversible data hiding and encryption,” Multimedia Tools and Applications, vol. 81, pp. 24721–24738 (2022), doi: 10.1007/s11042-022-12617-5.[23] B. Muruganantham, P. Shamili, S. Ganesh Kumar and A. Murugan, “Quantum cryptography for secured communication networks,” International Journal of Electrical and Computer Engineering, vol. 10, no. 1, pp. 407-414 (2020), doi: 10.11591/ijece.v10i1.pp407-414.[24] I. S. Kaushik, G. Deepak, and A. Santhanavijayan, “QuantQuery-EXP: A Novel Strategic Approach for Query Expansion Based on Quantum Computing Principles,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 23, no. 2, pp. 573–584 (2020), doi: 10.1080/09720529.2020.1729506.[25] Christopher Portmann and Renato Renner, “Security in quantum cryptography,” Reviews of Modern Physics, vol. 94, Art. no. 025008 (2022), doi: 10.48550/arXiv.2102.00021.[26] Mai Manh Trung, Le Phe Do, Do Trung Tuan, Nguyen Van Tanh and Ngo Quang Tri, “Design a cryptosystem using elliptic curves cryptography and Vigenère symmetry key,” International Journal of Electrical and Computer Engineering, vol. 13, no. 2, pp. 1734-1743 (Apr. 2023), doi: 10.11591/ijece.v13i2.pp1734-1743. [27] Sumit Gupta, Mayank Namdev, Ankur Goyal, Srinivas Samala, Deepika Dave, and Dheresh Soni, “Exploration of Quantum Computing and Communication Blocks with IBM Qiskit,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 7, pp. 2041–2052 (2024), doi: 10.47974/JDMSC-2078.
Views: 67Downloads: 7Citations: 0
