MODULAR EXPONENTIAL ALGORITHM IN AN ELECTRONIC COMPONENT USING A PUBLIC KEY ENCRYPTION ALGORITHM

摘要

For every Y(i) bit of a binary representation of Y, it is produced a variable i from 0 to k-1, which is the binary representation of a lower weight Y(O) toward the bit of weight strong Y(k-1). Z=Z2 operation is calculated and if I=0 it is performed R2=R1 asterisk Z or if I=1, it is calculated R1=R2 asterisk Z. Then Y(i)=O, then I remains unchanged and if Y(i)=1, then I is complemented. An Independent claim is included for: (a) an electronic terminal