TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover

Journal of Discrete Mathematical Sciences and Cryptography

(Since 1998)
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

CiteScore 2025: 2.7 (Q1)

Powered by:Powered by

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Taru Online First Current IssueSpecial IssuesBrowse all Issues
Journal of Discrete Mathematical Sciences and Cryptography
Open Access Research Article

Data-driven, transparent synthesis of lattice-based cryptosystems with hybrid security verification

, , * ,

* Corresponding author · click or hover a name for details

pp. 2093–2102Vol. 28Issue 5-BAugust 2025DOI: 10.47974/JDMSC-2426 Crossmark XML
Received:
05 Nov 2024
Published Online:
30 Aug 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2426
Pages:
2093–2102

Abstract

This paper introduces a unified, data-driven framework for the end-to-end synthesis and security verification of lattice-based cryptosystems. Beginning with a curated benchmark of real-world implementations (e.g., Kyber, NewHope, FrodoKEM), we extract normalized performance and security features to train a machine-learning model that predicts key-generation and encapsulation latencies with high fidelity (MAE < 5 µs, R² ≈ 0.91). We then enumerate parameter candidates within NIST’s 128-bit security envelope, rank them by a composite score of latency, key size, and failure rate, and select the top proposals. Each candidate undergoes rigorous statistical testing Kolmogorov Smirnov distribution checks and Test Vector Leakage Assessment and interactive-theorem-prover proofs for correctness and IND-CPA security, completing in under two minutes per template. Finally, the framework auto-generates PQClean-compliant C stubs with embedded provenance and CI scripts. Experimental results demonstrate that our pipeline yields deployment-ready schemes matching or exceeding manual baselines in performance while carrying machine-verified security guarantees.

Keywords

Lattice-based cryptographyPost-quantum cryptography (PQC)Machine learning for cryptanalysisHybrid security verificationIND-CPA security

Subject Classifications

94A60

References

[1] G. Fitzgibbon and C. Ottaviani, “Constrained device performance benchmarking with the implementation of post-quantum cryptography,” Cryptography, vol. 8, no. 2, art. 21 (2024).
[2] B. Biasioli, E. Kirshanova, C. Marcolla, and S. Rovira, “A tool for fast and secure LWE parameter selection: the FHE case,” IACR ePrint Archive, Rep. 2024/1895 (2024).
[3] W. Tan, Y. Lao, and K. K. Parhi, “KyberMat: Efficient accelerator for matrix-vector polynomial multiplication in CRYSTALS-Kyber scheme via NTT and polyphase decomposition,” arXiv preprint, arXiv:2310.04618 (2023).
[4] F. Segatz and M. I. Al Hafiz, “Efficient implementation of CRYSTALS-KYBER key encapsulation mechanism on ESP32,” arXiv preprint, arXiv:2503.10207 (2025).
[5] X. Zhang, H. Deng, R. Wu, J. Ren, Z. Li, Z. Zhang, and Y. Ren, “PQSF: Post-quantum secure privacy-preserving federated learning,” Scientific Reports, vol. 14, p. 23553 (2024).
[6] A. Melhem, “StableGWO: A grey wolf optimizer with von Neumann architecture enhancements,” Journal of Information & Optimization Sciences, vol. 46, no. 5, pp. 1385–1400 (May 2025).
[7] G. M. Abd-Elhamed and A. A. Azzam, “Graded S-r-ideals in cryptographic structures,” Journal of Discrete Mathematical Sciences & Cryptography, vol. 28, no. 1, pp. i–viii (Feb 2025).
[8] H. Khandani, “Fixed points in generalized α–β–FG contractions in b-metric spaces,” Journal of Interdisciplinary Mathematics (Mar 2025).

Views: 182Downloads: 29Citations: 0