Presentation 1996/7/22
Extension of RSA Cryptosystem to Algebraic Field and Hastad Attack
Tsuyoshi TAKAGI, Shozo NAITO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper investigates the problem in constructing RSA cryptosystem over the algebraic number field. Generating the prime ideal, choosing the complete representation class modulo an ideal, and reducing a number to the modulo class are main problems. For the cyclotomic field and the quadratic field, we describe the algorithms for solving these problems. These algorithms make it possible to construct the RSA cryptosystem over the cyclotomic field and the quadratic field. It is shown that breaking the proposed cryptosystem is as intractable as breaking original RSA cryptosystem. Furthermore, we show that the proposed RSA cryptosystem is stronger against the Hastad attack than the conventional system.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) RSA cryptosystem / cyclotomic field / quadratic field / security / Hastad attack
Paper # ISEC96-22
Date of Issue

Conference Information
Committee ISEC
Conference Date 1996/7/22(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 JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Extension of RSA Cryptosystem to Algebraic Field and Hastad Attack
Sub Title (in English)
Keyword(1) RSA cryptosystem
Keyword(2) cyclotomic field
Keyword(3) quadratic field
Keyword(4) security
Keyword(5) Hastad attack
1st Author's Name Tsuyoshi TAKAGI
1st Author's Affiliation NTT Software Laboratories()
2nd Author's Name Shozo NAITO
2nd Author's Affiliation NTT Software Laboratories
Date 1996/7/22
Paper # ISEC96-22
Volume (vol) vol.96
Number (no) 167
Page pp.pp.-
#Pages 8
Date of Issue