A fast modular multiplication algorithm for calculating the product AB modulo N

A fast modular multiplication algorithm for calculating the product AB modulo N is examined.

Uložené v:
Podrobná bibliografia
Vydané v:Information processing letters Ročník 72; číslo 3-4; s. 77 - 81
Hlavní autori: CHEN, C.-Y, CHANG, C.-C
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier Science 26.11.1999
Elsevier Sequoia S.A
Predmet:
Algorithms
Applied sciences
Cryptography
Exact sciences and technology
Information processing
Information, signal and communications theory
Signal and communications theory
Studies
Telecommunications and information theory
Multiplication
Cryptography
Cryptosystem
Algorithm
Binary number
Modular multiplication
ISSN:0020-0190, 1872-6119
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A fast modular multiplication algorithm for calculating the product AB modulo N is examined.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/s0020-0190(99)00137-4