scientific article
From MaRDI portal
Publication:3419881
zbMath1114.11001MaRDI QIDQ3419881
Publication date: 1 February 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
elliptic curvescryptographydiscrete Fourier transformfactorizationprimalitynumber-theoretic algorithms
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Numerical methods for discrete and fast Fourier transforms (65T50) Polynomials over finite fields (11T06) Mathematical problems of computer architecture (68M07) Factorization (11Y05) Primality (11Y11)
Related Items (5)
Complexity of computation in finite fields ⋮ Public-key cryptosystem based on invariants of diagonalizable groups ⋮ A deterministic algorithm for integer factorization ⋮ Об алгоритмах построения изогений эллиптических кривых над конечными полями и их приложениях ⋮ О вычислении кратных точек на эллиптических кривых над конечными полями с использованием нескольких оснований систем счисления и новых видов координат
This page was built for publication: