检索结果-南通市图书馆

A proof of maximum contention-free property of interleavers for Turbo codes using permutation polynomials over integer rings

引用

Journal of Zhejiang University-Science A(Applied Physics & Engineering) 2007年第1期8卷 24-27页

作者： MA Xin-rui XU You-yun ZHANG Le Department of Electronic Engineering Shanghai Jiao Tong University Shanghai 200240 China Institute of Communication Engineering PLA University of Science and Technology Nanjing 210007 China

It is well known that interleavers play a critical role in Turbo coding/decoding schemes, and contention-free interleaver design has become a serious problem in the paraUelization of Turbo decoding, which is indispensable to meet the demands for high throughput and low latency in next generation mobile communication systems. This paper unveils the fact that interleavers based on permutation polynomials modulo N are contention-free for every window size W, a factor of the intedeaver length N, which, also called maximum contention-free interleavers.

关键词： Turbo codes integer ring Permutation polynomial Interleaver Maximum contention-free (MCF)

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A proactive secret sharing scheme based on Chinese remainder theorem

引用

Frontiers of Computer Science 2021年第2期15卷 133-142页

作者： Keju MENG Fuyou MIAO Yu NING Wenchao HUANG Yan XIONG Chin-Chen CHANG School of Computer Science and Technology University of Science and Technology of ChinaHefei230026China Department of Information Engineering and Computer Science Feng Chia UniversityTaichung40724China School of Computer Science and Technology Hangzhou Dianzi UniversityHangzhou310018China

If an adversary tries to obtain a secret s in a(t,n)threshold secret sharing(SS)scheme,it has to capture no less than t shares instead of the secret s ***,if a shareholder keeps a fixed share for a long time,an adversary may have chances to filch some shareholders’*** a proactive secret sharing(PSS)scheme,shareholders are supposed to refresh shares at fixed period without changing the *** this way,an adversary can recover the secret if and only if it captures at least t shares during a period rather than any time,and thus PSS provides enhanced protection to long-lived *** existing PSS schemes are almost based on linear SS but no Chinese Remainder Theorem(CRT)-based PSS scheme was *** paper proposes a PSS scheme based on CRT for integer ring to analyze the reason why traditional CRT-based SS is not suitable to design PSS ***,an ideal PSS scheme based on CRT for polynomial ring is also *** scheme utilizes isomorphism of CRT to implement efficient share refreshing.

关键词： proactive secret sharing Chinese remainder theorem polynomial ring integer ring isomorphism

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：