Back to Results
First PageMeta Content
Mathematics / Residue number system / Multiplication algorithm / Coprime / Multiplicative order / XTR / Abstract algebra / Modular arithmetic / Ring theory


1 Efficient RNS bases for Cryptography
Add to Reading List

Document Date: 2006-10-16 02:29:29

Open Document

File Size: 114,08 KB

Share Result on Facebook

City

Denver / Vail Colorado / Santa Monica / /

Company

IEEE Computer Society Press / The Residue Number Systems / McGraw-Hill / /

Country

United States / /

/

Event

Reorganization / /

Facility

University of Montpellier / H. L. Garner / /

IndustryTerm

basic modulo algorithms / addition algorithm / digital processor / cryptographic applications / present conversion algorithms / adleman public key encryption algorithm / implemente parallel computing / number systems / moduli multiplication operator / digital signal processing / montgomery modular multiplication algorithm / multiplication algorithms / very interesting modular multiplication algorithms / /

Organization

University of Montpellier / /

Person

Jean-Claude Bajard / Peter Montgomery / Richard Conway / Thomas Plantard / Donald Knuth / John Nelson / Nicolas Meloni / /

Position

editor / /

ProvinceOrState

Colorado / /

PublishedMedium

IEEE Transactions on Computers / /

Technology

following algorithm Algorithm / This algorithm / Cryptography / following algorithm / specific algorithms / Barrett algorithm / multiplication algorithms / basic modulo algorithms / addition algorithm / mj To resume algorithm / multiplication algorithm / adleman public key encryption algorithm / DSP / 5 Algorithm / present conversion algorithms / /

SocialTag