Efficient Modular Reduction Algorithm in $$ \mathbb{F}_q $$ [x] and Its Application to “Left to Right” Modular Multiplication in $$ \mathbb{F}_2 $$ [x] (Q5187956): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-45238-6_17 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2223160607 / rank | |||
Normal rank | |||
Latest revision as of 22:56, 19 March 2024
scientific article; zbMATH DE number 5679232
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Modular Reduction Algorithm in $$ \mathbb{F}_q $$ [x] and Its Application to “Left to Right” Modular Multiplication in $$ \mathbb{F}_2 $$ [x] |
scientific article; zbMATH DE number 5679232 |
Statements
Efficient Modular Reduction Algorithm in $$ \mathbb{F}_q $$ [x] and Its Application to “Left to Right” Modular Multiplication in $$ \mathbb{F}_2 $$ [x] (English)
0 references
9 March 2010
0 references
smart card
0 references
cryptography
0 references
modular multiplication
0 references
quotient evaluation
0 references
elliptic curves
0 references
ECDSA
0 references
Montgomery
0 references
Barrett
0 references
multiply and add without carries
0 references
multiplications in \(\mathbb F_2[x]\)
0 references
