Presentation 1997/11/20
A study of integer factorization based on the CFRAC method
Qian Li, Kunikatsu KOBAYASHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this report, based on the CFRAC method, by introducing a kind of function, we build a new quadratic congruence equation. From it we propose an integer factorization algorithm of which the computational complexity depends on the period of continued fraction. Our numerical experiments not only present its efficiency, but also show that two kind of n patterns can not be applicable to the RSA cryptosystem.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) the CFRAC method / quadratic congruence equation / computational complexity / period of continued fraction / RSA cryptosystem
Paper # ISEC97-50
Date of Issue

Conference Information
Committee ISEC
Conference Date 1997/11/20(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A study of integer factorization based on the CFRAC method
Sub Title (in English)
Keyword(1) the CFRAC method
Keyword(2) quadratic congruence equation
Keyword(3) computational complexity
Keyword(4) period of continued fraction
Keyword(5) RSA cryptosystem
1st Author's Name Qian Li
1st Author's Affiliation Department of Electrical and Information Engineering, Faculty of Engineering, Yamagata University()
2nd Author's Name Kunikatsu KOBAYASHI
2nd Author's Affiliation Department of Electrical and Information Engineering, Faculty of Engineering, Yamagata University
Date 1997/11/20
Paper # ISEC97-50
Volume (vol) vol.97
Number (no) 381
Page pp.pp.-
#Pages 8
Date of Issue