Bignum Arithmetic by AWS
The s2n-bignum project on GitHub provides optimized integer arithmetic routines for cryptography. It includes assembly code for speed and HOL-Light proofs for verification, supporting various languages and emphasizing security and performance.
Read original article
The GitHub repository at the provided URL contains information about the s2n-bignum project, which offers integer arithmetic routines tailored for cryptographic purposes. These routines are optimized for performance and correctness, featuring assembly code for speed and formal proofs in HOL-Light for verification. The project supports integration with C and other high-level languages, focusing on building, usage, architecture considerations for ARM and x86, constant-time bignums, functions, testing, formal verification, benchmarking, and security aspects. For further details or support regarding this project, additional inquiries are encouraged.
Related
Own Constant Folder in C/C++
Neil Henning discusses precision issues in clang when using the sqrtps intrinsic with -ffast-math, suggesting inline assembly for instruction selection. He introduces a workaround using __builtin_constant_p for constant folding optimization, enhancing code efficiency.
Y292B Bug
The Y292B bug is a potential timekeeping issue in Unix systems due to a rollover in the year 292,277,026,596. Solutions involve using dynamic languages or GNU Multiple Precision Arithmetic Library in C, emphasizing the need for kernel-level fixes.
Summing ASCII encoded integers on Haswell at almost the speed of memcpy
Matt Stuchlik presents a high-performance algorithm for summing ASCII-encoded integers on Haswell systems. It utilizes SIMD instructions, lookup tables, and efficient operations to achieve speed enhancements, showcasing innovative approaches in integer sum calculations.
Show HN: You can program without loop and recursion and×÷- is all you need
A language named "Ar" on GitHub, inspired by Blindfolded Arithmetic and Z3, is Turing complete with functions like inc, sub, mul, and div. It implements various operations and aims to compute the Ackermann function, sparking discussions.
Optimizing a Bignum Library for Fun
Austin Z. Henley from Carnegie Mellon University optimizes a bignum library by switching to 30-bit digits, boosting performance significantly. Despite improvements, he plans to add more core features for a comprehensive library.
3 commentsRelated
Own Constant Folder in C/C++
Neil Henning discusses precision issues in clang when using the sqrtps intrinsic with -ffast-math, suggesting inline assembly for instruction selection. He introduces a workaround using __builtin_constant_p for constant folding optimization, enhancing code efficiency.
Y292B Bug
The Y292B bug is a potential timekeeping issue in Unix systems due to a rollover in the year 292,277,026,596. Solutions involve using dynamic languages or GNU Multiple Precision Arithmetic Library in C, emphasizing the need for kernel-level fixes.
Summing ASCII encoded integers on Haswell at almost the speed of memcpy
Matt Stuchlik presents a high-performance algorithm for summing ASCII-encoded integers on Haswell systems. It utilizes SIMD instructions, lookup tables, and efficient operations to achieve speed enhancements, showcasing innovative approaches in integer sum calculations.
Show HN: You can program without loop and recursion and×÷- is all you need
A language named "Ar" on GitHub, inspired by Blindfolded Arithmetic and Z3, is Turing complete with functions like inc, sub, mul, and div. It implements various operations and aims to compute the Ackermann function, sparking discussions.
Optimizing a Bignum Library for Fun
Austin Z. Henley from Carnegie Mellon University optimizes a bignum library by switching to 30-bit digits, boosting performance significantly. Despite improvements, he plans to add more core features for a comprehensive library.