Big Integers for Cryptography in SPARK

César Sagaert

doi:10.1145/3821489.3821500

December 1, 2025ACM SIGAda Ada Letters

Big Integers for Cryptography in SPARK

View at Publisher

Ask AI

Bookmark

Share

Key Points

The aim is to develop a verified implementation of constant-time big integer arithmetic for cryptographic uses.
Presented a partially formally verified implementation in SPARK.
Implemented constant-time big integer arithmetic including modular arithmetic.
Achieved constant-time operations to enhance cryptographic security.
Implemented big integers crucial for maintaining secure communication.

Ask about this paper

Answers are grounded in this paper and cite their sources.

Implication

Reveals effectiveness of constant-time big integer operations in cryptography, suggesting enhanced security.

Abstract

Constant-time big integer operations are a critical component of modern cryptography implementations. I present a (partially) formally verified implementation of constant-time big integer arithmetic in SPARK, including modular arithmetic.

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

César Sagaert (2025) studied this question.

synapsesocial.com/papers/6a34df4a65a5b0777af2e68d https://doi.org/10.1145/3821489.3821500

View at Publisher

Ask AI

Bookmark

Share

Big Integers for Cryptography in SPARK

Key Points

Ask about this paper

Implication

Abstract

Discussion

Cite This Study

Big Integers for Cryptography in SPARK

Key Points

Ask about this paper

Implication

Abstract

Discussion

Cite This Study

Keep reading

Keep reading