( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Proving the Primality of Very Large Numbers with fastECPP.

, , , и . ANTS, том 3076 из Lecture Notes in Computer Science, стр. 194-207. Springer, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Thorsten Kleinjung

Hans Kleinjung

Frank Kleinjung

Hartmut Kleinjung

Christine Kleinjung

 

Другие публикации лиц с тем же именем

Proving the Primality of Very Large Numbers with fastECPP., , , и . ANTS, том 3076 из Lecture Notes in Computer Science, стр. 194-207. Springer, (2004)Improved key recovery on the Legendre PRF., , и . IACR Cryptology ePrint Archive, (2020)On the Use of the Negation Map in the Pollard Rho Method., , и . ANTS, том 6197 из Lecture Notes in Computer Science, стр. 66-82. Springer, (2010)Revisiting ECM on GPUs., , , , , и . CANS, том 12579 из Lecture Notes in Computer Science, стр. 299-319. Springer, (2020)CSI-FiSh: Efficient Isogeny Based Signatures Through Class Group Computations., , и . ASIACRYPT (1), том 11921 из Lecture Notes in Computer Science, стр. 227-247. Springer, (2019)Efficient SIMD Arithmetic Modulo a Mersenne Number., , , и . IEEE Symposium on Computer Arithmetic, стр. 213-221. IEEE Computer Society, (2011)Computation of a 30750-Bit Binary Field Discrete Logarithm., , , , и . IACR Cryptol. ePrint Arch., (2020)A new perspective on the powers of two descent for discrete logarithms in finite fields., и . IACR Cryptology ePrint Archive, (2018)A practical analytic method for calculating 휋(x)., , , и . Math. Comput., 86 (308): 2889-2909 (2017)Quadratic sieving.. Math. Comput., (2016)