KFU. Card publication. Lenstra Factorization Method Convergence Investigation on Elliptic Curves

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

LENSTRA FACTORIZATION METHOD CONVERGENCE INVESTIGATION ON ELLIPTIC CURVES

Form of presentation

Articles in international journals and collections

Year of publication

2015

Язык

английский

Authors, employees of KFU

Ishmukhametov Shamil Talgatovich, author

Rubcova Ramilya Gakilevna, author

Authors, postgraduates KFU

Amer Ismail F O, postgraduate kfu

Bibliographic description in the original language

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

Annotation

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.

Keywords

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

The name of the journal

Research Journal of Applied Sciences

Please use this ID to quote from or refer to the card

https://repository.kpfu.ru/eng/?p_id=125989&p_lang=2

Full metadata record

Field DC	Value	Language
dc.contributor.author	Ishmukhametov Shamil Talgatovich	ru_RU
dc.contributor.author	Rubcova Ramilya Gakilevna	ru_RU
dc.contributor.author	Amer Ismail F O	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/eng/?p_id=125989&p_lang=2	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	Articles in international journals and collections	ru_RU