中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Subject: Mathematics
Title:
on enumeration of polynomial equivalence classes
Author: Wang TianZe ; Lin DongDai
Conference Name: SCIENCE CHINA Mathematics
Issued Date: 2012
Keyword: enumerative problem – ; isomorphism of polynomials – ; finite geometry
Indexed Type: SPRINGER ; SCI
ISSN: 1674-7283
Department: State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing 100190 China
Abstract: The isomorphism of polynomials (IP), one of the hard problems in multivariate public key cryptography induces an equivalence relation on a set of systems of polynomials. Then the enumeration problem of IP consists of counting the numbers of different classes and counting the cardinality of each class that is highly related to the scale of key space for a multivariate public key cryptosystem. In this paper we show the enumeration of the equivalence classes containing when char = 2, which implies that these polynomials are all weak IP instances. Moreover, we study the cardinality of an equivalence class containing the binomial over without the restriction that char() = 2, which gives us a deeper understanding of finite geometry as a tool to investigate the enumeration problem of IP.
English Abstract: The isomorphism of polynomials (IP), one of the hard problems in multivariate public key cryptography induces an equivalence relation on a set of systems of polynomials. Then the enumeration problem of IP consists of counting the numbers of different classes and counting the cardinality of each class that is highly related to the scale of key space for a multivariate public key cryptosystem. In this paper we show the enumeration of the equivalence classes containing when char = 2, which implies that these polynomials are all weak IP instances. Moreover, we study the cardinality of an equivalence class containing the binomial over without the restriction that char() = 2, which gives us a deeper understanding of finite geometry as a tool to investigate the enumeration problem of IP.
Language: 英语
Citation statistics:
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/15736
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Wang TianZe,Lin DongDai. on enumeration of polynomial equivalence classes[C]. 见:SCIENCE CHINA Mathematics.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Wang TianZe]'s Articles
[Lin DongDai]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Wang TianZe]‘s Articles
[Lin DongDai]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace