Learn More
  • R. Popovych
  • 2004
Possible approaches to cryptoanalysis RSA system of enciphering with public key are considered, especially with using of Euler function value. RSA algorithm is used in computer payment system of national bank of Ukraine national payment system, which provides implementation of accounts amongst bank institutions, boards of state treasury on the territory of(More)
We propose to verify the AKS algorithm identities not for sequential integers, but for integers which are sequentially squared. In that case a number of elements, for which the identities are valid, doubles. 1. Introduction Prime numbers are of fundamental importance in mathematics in general, and cryptography theory in particular. Efficient primality tests(More)
We prove that Lenstra proposition suggesting existence of many counterexamples to Agrawal conjecture is true in a more general case. At the same time we obtain a strictly ascending chain of subgroups of the group (Z p [X]/(C r (X))) * and state the modified conjecture that the set {X-1, X+2} generate big enough subgroup of this group.
  • 1