A Cryptographic Engineering Approach for Constructing Entry Points for the Miller-Satoh Inversion Algorithm

This 17-page technical research addresses a critical challenge in pairing-based cryptography implementation for defense applications. The work focuses on optimizing the Miller-Satoh inversion algorithm for Barreto-Naehrig curves, specifically targeting resource-constrained military tactical devices. Key Contributions: • Developed a deterministic construction method for Satoh entry points using twist-aware Frobenius endomorphisms • Achieved significant performance improvements for zero-knowledge proof verification in secure enclaves • Provided rigorous mathematical validation with practical Python implementation • Addressed real-world constraints of battlefield communication systems Military Applications: The solution enables efficient implementation of advanced cryptographic protocols in tactical networks, supporting secure authentication, ZKP-based access control, and robust communication under adverse conditions. While specific deployment details remain classified, this research contributes to the broader cryptographic community's understanding of pairing-based systems optimization. The methodology bridges theoretical cryptography with practical engineering requirements, ensuring both mathematical rigor and operational reliability for mission-critical applications. Available for academic and research collaboration in applied cryptography and defense technologies.

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-10-01
DOI
https://doi.org/10.5281/zenodo.17243839
Primary Topic
Cryptography and Residue Arithmetic
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Cryptographic Engineering Approach for Constructing Entry Points for the Miller-Satoh Inversion Algorithm

Zenodo (CERN European Organization for Nuclear Research)
Cryptography and Residue Arithmetic
article

A Cryptographic Engineering Approach for Constructing Entry Points for the Miller-Satoh Inversion Algorithm

article en

Abstract

This 17-page technical research addresses a critical challenge in pairing-based cryptography implementation for defense applications. The work focuses on optimizing the Miller-Satoh inversion algorithm for Barreto-Naehrig curves, specifically targeting resource-constrained military tactical devices. Key Contributions: • Developed a deterministic construction method for Satoh entry points using twist-aware Frobenius endomorphisms • Achieved significant performance improvements for zero-knowledge proof verification in secure enclaves • Provided rigorous mathematical validation with practical Python implementation • Addressed real-world constraints of battlefield communication systems Military Applications: The solution enables efficient implementation of advanced cryptographic protocols in tactical networks, supporting secure authentication, ZKP-based access control, and robust communication under adverse conditions. While specific deployment details remain classified, this research contributes to the broader cryptographic community's understanding of pairing-based systems optimization. The methodology bridges theoretical cryptography with practical engineering requirements, ensuring both mathematical rigor and operational reliability for mission-critical applications. Available for academic and research collaboration in applied cryptography and defense technologies.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 34%
Cryptography and Residue Arithmetic
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.