Results: **3**

#### On the optimal passing of distinguished points for parallelized Pollard’s rho-method

Problems of development and realization of an efficient parallelized algorithm to solve **elliptic** **curve** discrete logarithm problem (ECDLP) based on Pollard’s rho-method in the computational model SPMD using technology of message passing are considered. It is researched how many central processes are needed and what proportion of distinguished points ...

#### An analysis of the resistance of McEliece CS based on an AG-code to quantum Fourier sampling attack

This article tests the quantum resistance of McEliece CS based on an AG-code over any **elliptic** **curve**. Using the criteria suggested by Dinh, Moore, and Russell [3], the author proves the resistance of this CS to quantum Fourier sampling attack. Thus, Shor’s algorithm cannot identify the group structure of the code and break the CS.
1. Shor P....

#### Efficient algorithms for computing superelliptic **curves**

Represents basics algorithms of arithmetics superelliptic **curves** and optimal parameters superelliptic **curve** suitable for cryptography.
1.Koblitz N. **Elliptic** **curve** cryptosystems // Mathematics of Computation. 1987. № 48 (177). P. 203–209.
2. ANSI X9.63 Public Key Cryptography for the Financial Services Industry: El-liptic **Curve** Key Agreement and Key Transport Schemes. Working Draft - Ver-sion 2.0. 1998....