Our Publications
Peer-reviewed research advancing the state of the art in cryptography, zero-knowledge systems, and formal verification.
Efficient GHASH and POLYVAL Implementation Using Polynomial Multiplication
Optimized 64-bit Decomposition with Bit-Reversal Elimination
Introduces a 64-bit decomposition method that computes universal hash functions directly in bit-reversed form, eliminating a fundamental inefficiency in GHASH/POLYVAL implementations. The approach integrates seamlessly with existing AES-GCM and AES-GCM-SIV pipelines while maintaining constant-time guarantees.
Deferred Reduction Optimizations for Post-Quantum Lattice Cryptography
ML-KEM and ML-DSA
A unified framework of deferred modular reduction optimizations for ML-KEM and ML-DSA post-quantum cryptographic algorithms. Minimizes computational overhead through coefficient bound analysis while maintaining constant-time security properties.
ZK IR: A Minimalist Instruction Set Architecture for Efficient Zero-Knowledge Proof Generation
32-bit Design for STARK-Based Proving
A specialized 32-bit instruction set architecture tailored for zero-knowledge proof generation with STARK protocols. Demonstrates that a pure 32-bit register design using software-based multi-precision arithmetic achieves approximately 2× reduction in constraint count compared to naive approaches.
LLM-as-Specification-Judge
Multi-Model Consensus for Trustworthy Cryptographic Verification
Addresses a critical vulnerability in formal verification: while proof assistants provide strong mathematical guarantees, specifications remain susceptible to human error. Proposes Specification Consensus using multiple independent LLMs to generate diverse formal specifications and verify consistency.
Interested in collaborating?
We're always looking to collaborate with researchers and organizations pushing the boundaries of cryptography and security.
Get in Touch