Hi! I am doing a homework about RSA1024. I am using Montgomery
algorithm to do it.Now I have some question would you help me?
The keysize is 1024 bits,so I use a array to store it.Everyone stores
16 bits.
I want to whether it is a Montgomery algorithm
input: A ,B ,N (modulus)
step1: P = 0
step2: fo r i= 0 to n- 1 do
2a: P = P + A[i]*B
2b: if (P[0]= 1) P = P + N
2c: P = P/2
step3: if (P > N ) P = P - N
step4: return (P )
the up is not base on 1024bita and my array.
if use my methods.in the 2b,should p[0] be changed? and p=p/2 should
be changed?how to change? And what is it the result?A*B*2^-(n+2) mod N
or A*B*2^-(n) mod N?
Algorithm for storing and averaging data over time ... I am looking for a method or algorithm to store some kind of data ... data in the array is shifted by one element, so that ais the most ... To store N seconds of data with a 1-second resolution would thus ... I am looking for a similar algorithm,... (comp.programming)
Re: regex question - trying to find ".mp3" in a SELECT box ... But `Array' is a Function object reference. ... Establish a new execution context using F's FormalParameterList, ... Since is not a primitive value, the exception should be thrown. ... | 5.2 Algorithm Conventions... (comp.lang.javascript)
Re: Reference to derived type element by index? ... as a set of distinctively-named scalars.... In another scope, the same common block... would be a single array....algorithm and a specific application of the algorithm, ... (comp.lang.fortran)
Re: counting subsets of S so that sum(S_n) = N ... and make my algorithm generate only unique subsets? ... and the array of boolean at one step of the algorithm is ... implementation without needing recursion....subsequence in W, process it and return. ... (comp.programming)
[SUMMARY] Maximum Sub-Array (#131) ... # sum the integer values of array contents ...algorithm,... all possible lengths, to check each subarray.... $ time ruby -r max_sub_array ... (comp.lang.ruby)
