Art

J-GLOBAL ID：200902177926706526   Reference number：01A0160291

A New Product-Sum Type Public Key Cryptosystem Based on Reduced Bases.

次数低減基底を用いた新しい積和型公開鍵暗号方式

Author (4)： SUZUKI D (Kyoto Inst. Technol., Kyoto-shi, JPN) ,  MURAKAMI Y (Kyoto Inst. Technol., Kyoto-shi, JPN) ,  SAKAI R (Osaka Electro-Communication Univ., Neyagawa-shi, JPN) ,  KASAHARA M (Kyoto Inst. Technol., Kyoto-shi, JPN)
Material： IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Institute of Electronics, Information and Communication Engineers)  (IEICE Trans Fundam Electron Commun Comput Sci (Inst Electron Inf Commun Eng))
Volume： E84-A  Issue： 1  Page： 326-330  Publication year： Jan. 01, 2001 
JST Material Number： F0699C  ISSN： 0916-8508  Document type： Article
Article type： 短報  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *public key cryptography ,...

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=01A0160291&from=J-GLOBAL&jstjournalNo=F0699C") }}

JST classification (1)： Code theory  (ND02030R)

Reference (8)：

• LAGARIAS, J. C. Solving low density subset sum problems. J. ACM. 1985, 32, 229-246
• LENSTRA, A. K. Factoring polynomials with rational coefficients. Math. Ann. 1982, 26, 515-534
• KASAHARA, M. New public-key cryptosystems. 1998, 33-40
• KASAHARA, M. New public-key cryptosystems. 1999, 33-39
• KASAHARA, M. Prizewinning problem. 1999

Terms in the title (3)： 次数低減 ,  基底 ,  公開鍵暗号方式