КФУ. Карточка публикации. Lenstra Factorization Method Convergence Investigation on Elliptic Curves

КАЗАНСКИЙ
ФЕДЕРАЛЬНЫЙ УНИВЕРСИТЕТ

RUS

- EN
- 中文
- ES

LENSTRA FACTORIZATION METHOD CONVERGENCE INVESTIGATION ON ELLIPTIC CURVES

Форма представления

Статьи в зарубежных журналах и сборниках

Год публикации

2015

Язык

английский

Авторы, сотрудники КФУ

Ишмухаметов Шамиль Талгатович, автор

Рубцова Рамиля Гакилевна, автор

Авторы, аспиранты КФУ

Амер Исмаил Ф О, автор

Библиографическое описание на языке оригинала

Ismail Amer, Shamil T Ishmukhametov, Ramilya G Rubtsova. Lenstra Factorization Method Convergence Investigation on Elliptic Curves//Research Journal of Applied Sciences. - 2015, V.10,№8,p.365-370. Scopus

Аннотация

It is well known that the process of natural numbers decomposition in a product of primefactors (factorization) is a time?consuming computational procedure. This property is widely used in cryptography. In particular, the known RSA encryption method uses a composite number n of 1024 bits or more which is the product of two prime numbers as the secret key. One of the most effective methods of integer factorization is H. LenstIy Method based on the arithmetic of elliptic curves.

Ключевые слова

Factorization of integers, H. Lenstra algorithm, elliptic curves, RSA encryption, smooth integers, distribution of smooths

Название журнала

Research Journal of Applied Sciences

Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на эту карточку

https://repository.kpfu.ru/?p_id=125989

Полная запись метаданных

Поле DC	Значение	Язык
dc.contributor.author	Ишмухаметов Шамиль Талгатович	ru_RU
dc.contributor.author	Рубцова Рамиля Гакилевна	ru_RU
dc.contributor.author	Амер Исмаил Ф О	ru_RU
dc.date.accessioned	2015-01-01T00:00:00Z	ru_RU
dc.date.available	2015-01-01T00:00:00Z	ru_RU
dc.date.issued	2015	ru_RU
dc.identifier.citation	Ismail Amer, Shamil T Ishmukhametov, Ramilya G Rubtsova. Lenstra Factorization Method Convergence Investigation on Elliptic Curves//Research Journal of Applied Sciences. - 2015, V.10,№8,p.365-370. Scopus	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/?p_id=125989	ru_RU
dc.description.abstract	Research Journal of Applied Sciences	ru_RU
dc.description.abstract	It is well known that the process of natural numbers decomposition in a product of primefactors (factorization) is a time?consuming computational procedure. This property is widely used in cryptography. In particular, the known RSA encryption method uses a composite number n of 1024 bits or more which is the product of two prime numbers as the secret key. One of the most effective methods of integer factorization is H. LenstIy Method based on the arithmetic of elliptic curves.	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	Factorization of integers	ru_RU
dc.subject	H. Lenstra algorithm	ru_RU
dc.subject	elliptic curves	ru_RU
dc.subject	RSA encryption	ru_RU
dc.subject	smooth integers	ru_RU
dc.subject	distribution of smooths	ru_RU
dc.title	Lenstra Factorization Method Convergence Investigation on Elliptic Curves	ru_RU
dc.type	Статьи в зарубежных журналах и сборниках	ru_RU