Efficient arithmetic in (pseudo-)Mersenne prime order fields (Q2085714): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: KummerLineV02 / rank | |||
Normal rank | |||
Revision as of 09:41, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient arithmetic in (pseudo-)Mersenne prime order fields |
scientific article |
Statements
Efficient arithmetic in (pseudo-)Mersenne prime order fields (English)
0 references
18 October 2022
0 references
field multiplication/squaring/reduction/inversion
0 references
Mersenne primes
0 references
pseudo-Mersenne primes
0 references
constant-time computation
0 references
Fermat's little theorem
0 references
elliptic curve cryptography
0 references
scalar multiplication
0 references
