-
Imported from SourceForge on 2024-07-03 07:34:44
Created by **[macrakis](https://sourceforge.net/u/macrakis/)** on 2002-10-18 13:50:47
Original: https://sourceforge.net/p/maxima/bugs/163
---
poly:…
rtoy updated
4 months ago
-
In GitLab by @skahn on Nov 28, 2020, 22:24
## Description
The REBCO VIPER design uses solid section of Cu without void fraction. This section has hence an good young modulus, increasing the WP stiff…
-
I'm trying to use fiat-crypto to synthesize (bedrock2) C code for NTT operations as used in some PQ lattice-based cryptography, where the prime modulus fits in one word.
How difficult would it be to …
-
This is the minimal contract that I've been able to create to show the issue.
```
contract PreModExpBUG {
function modexp_test() public {
assembly {
// free memory point…
-
In #349 I suggested adopting some sort of ceiling on the size of integers that are acceptable for signatures, i.e. a maximum modulus size. This would prevent parsing some large amount of data that doe…
-
"abcabcd" % "ab" = "ccd"
-
In ApproxSwitchCRTBasis, SwitchModulus is not called explicitly nor seems to be called implicitly in the above build settings. The specific code referenced here can be found [here](https://github.com/…
-
### Version
latest
### On which installation method(s) does this occur?
_No response_
### Describe the issue
See log output below
### Minimum reproducible example
_No response_
### Relevant lo…
-
Thanks for the very interesting paper! I have two questions regarding modular division:
1. Does figure 1 of the paper correspond to this equation `x◦y=x/y (mod p) for 0≤x
-
While trying to use SEAL for a use case where the `plain_modulus` is the smallest prime of the `coeff_modulus_base`, I realised that the RNS optimisation implemented by SEAL seems to forbid any case …