Presentation 2001/9/10
Cryptanalysis On Public Key Cryptosystem K_I
KENGO OKETANI, RYUICHI SAKAI, MASAO KASAHARA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this report an analysis is made on the public-key cryptosystem K_I over GF(2^k)where each entity can freely choose a combination of public keys among overwhelming number of combinations. Public-key cryptosystem K_I has features that it is invulnerable to the attack based on the LLL algorithm and that any secret key cannot be disclosed. We show that given the cyphertext, the original message can be recovered without knowing any secret key.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) finite field / extension field / product-sum cryptsystem / linear attack
Paper # ISEC 2001-63
Date of Issue

Conference Information
Committee ISEC
Conference Date 2001/9/10(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) Cryptanalysis On Public Key Cryptosystem K_I
Sub Title (in English)
Keyword(1) finite field
Keyword(2) extension field
Keyword(3) product-sum cryptsystem
Keyword(4) linear attack
1st Author's Name KENGO OKETANI
1st Author's Affiliation Department of Electronics, Information System and Energy Engineering, Graduate School of Engineering, Osaka University()
2nd Author's Name RYUICHI SAKAI
2nd Author's Affiliation Department of Faculty of Engineering, Osaka Electro-Communication University
3rd Author's Name MASAO KASAHARA
3rd Author's Affiliation Department of Faculty of Informatics, Osaka Gakuin University
Date 2001/9/10
Paper # ISEC 2001-63
Volume (vol) vol.101
Number (no) 311
Page pp.pp.-
#Pages 8
Date of Issue