On the convergence of iterations for a method of solution of discrete logarithm representation problem by means of rational approximations
Matematičeskie voprosy kriptografii, Tome 1 (2010) no. 4, pp. 111-125
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
The paper contains partial justification of author's method permitting to transform a pair of congruences so that coefficients in these congruences became smaller. It is supposed that this method may be used in a new approach to the discrete logarithm problem.
[1] Khinchin A. Ya., Tsepnye drobi, ONTI, NKTM, M., 1935
[2] Tarakanov V. E., “Novye serii ratsionalnykh approksimatsii i nekotorye ikh primeneniya”, Matem. zametki, 76:2 (2004), 237–257 | MR | Zbl
[3] Tarakanov V. E., “Ob odnom podkhode k resheniyu zadachi diskretnogo logarifmirovaniya s pomoschyu ratsionalnykh approksimatsii”, Trudy po diskretnoi matematike, 10, 2007, 301–314
[4] Tarakanov V. E., “K resheniyu zadachi predstavleniya diskretnogo logarifma chisla v vide summy logarifmov malykh prostykh chisel s pomoschyu ratsionalnykh approksimatsii”, Trudy po diskretnoi matematike, 11, no. 2, 2008, 192–206