| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 694 1 |
| Ultima descărcare din IBN: 2021-01-23 09:07 |
 SM ISO690:2012MOLDOVYAN, Nikolay, MOLDOVYANU, P.. New primitives for digital signature algorithms. In: Quasigroups and Related Systems, 2009, vol. 17, nr. 2(22), pp. 271-282. ISSN 1561-2848. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Quasigroups and Related Systems | ||||||
| Volumul 17, Numărul 2(22) / 2009 / ISSN 1561-2848 | ||||||
|
||||||
| Pag. 271-282 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
Particular types of the multiplication operation over elements of the nite vector space over the eld GF(pd), d > 1, are introduced so that there are formed the nite elds GF(pd)m with fast multiplication operation that also suites well to parallelized implementation. Finite elds implemented in such form are proposed for accelerating the digital signature algorithms. |
||||||
|
|
|
|
