METHOD AND DEVICE TO GENERATE COMPRESSED RSA MODULE Russian patent published in 2012 - IPC H04L9/30 

FIELD: information technologies.

SUBSTANCE: in a method to generate multipliers of an RSA module N with a predetermined part N_h and a pre-undetermined part N₁ the RSA module contains at least two multipliers, at the same time the method includes stages, at which the following is carried out: the first prime number p is generated in the range so that gcd(p-1,e)=1, where e is an open index and (n - n₀) is a bit length of p; the value N_h is produced, which forms a part of N; the second prime number q is generated in the range so that gcd(q-1,e)=1; and N=N_h || N₁, where N₁=(pq)mod 2^n-k; and representation of N at least compressed without losses is produced, which makes it possible to definitely restore N; at the same time q is randomly generated in a predetermined range depending on p and N_h so that pq is an RSA module, a part of which is N_h, which contains k bits and heads the RSA module, which is an n-bit module.

EFFECT: improved efficiency.

6 cl, 1 dwg