检索结果-南通市图书馆

Blockchain-Based Certificateless Bidirectional Authenticated Searchable Encryption Scheme in Cloud Email System

Computer Modeling in Engineering & Sciences 2024年第6期139卷 3287-3310页

作者： Yanzhong Sun xiaoni du Shufen Niu Xiaodong Yang College of Mathematics and Statistics Northwest Normal UniversityLanzhou730070China College of Computer Science and Engineering Northwest Normal UniversityLanzhou730070China

Traditional email systems can only achieve one-way communication,which means only the receiver is allowed to search for emails on the email *** this paper,we propose a blockchain-based certificateless bidirectional authenticated searchable encryption model for a cloud email system named certificateless authenticated bidirectional searchable encryption(CL-BSE)by combining the storage function of cloud server with the communication function of email *** the new model,not only can the data receiver search for the relevant content by generating its own trapdoor,but the data owner also can retrieve the content in the same ***,there are dual authentication functions in our ***,during encryption,the data owner uses the private key to authenticate their identity,ensuring that only legal owner can generate the keyword ***,the blockchain verifies the data owner’s identity by the received ciphertext,allowing only authorized members to store their data in the server and avoiding unnecessary storage space *** obtain a formal definition of CL-BSE and formulate a specific scheme from the new system *** the security of the scheme is analyzed based on the formalized security *** results demonstrate that the scheme achieves multikeyword ciphertext indistinguishability andmulti-keyword trapdoor privacy against any adversary *** addition,performance evaluation shows that the new scheme has higher computational and communication efficiency by comparing it with some existing ones.

关键词： Cloud email system authenticated searchable encryption blockchain-based designated server test multi-trapdoor privacy multi-ciphertext indistinguishability

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

改进的减轮E2算法中间相遇攻击

引用

电子与信息学报 2024年第6期46卷 2655-2662页

作者：杜小妮孙瑞郑亚楠梁丽芳西北师范大学数学与统计学院兰州730070 西北师范大学密码技术与数据分析重点实验室兰州730070 甘肃省数学与统计学基础学科研究中心兰州730070

E2算法是AES首轮征集的15个候选算法之一,具有优良的软硬件实现效率和较强的安全性。该文利用多重集和差分枚举技术,对E2算法进行中间相遇攻击。首先以E2-128为例,改进了已有的4轮中间相遇区分器,将5轮密钥恢复攻击预计算复杂度降低为2^... 详细信息

E2算法是AES首轮征集的15个候选算法之一,具有优良的软硬件实现效率和较强的安全性。该文利用多重集和差分枚举技术,对E2算法进行中间相遇攻击。首先以E2-128为例,改进了已有的4轮中间相遇区分器,将5轮密钥恢复攻击预计算复杂度降低为2^(31)次5轮算法加密。其次针对E2-256,将所得区分器向后增加两轮,构造了6轮中间相遇区分器,并实现了9轮中间相遇攻击,攻击所需的数据复杂度为2^(105)个选择明文,存储复杂度为2^(200)Byte,时间复杂度为2^(205)次9轮算法加密。与现有对E2算法的安全性分析结果相比,该文实现了对E2-256最长轮数的攻击。

关键词：分组密码 E2算法中间相遇攻击差分枚举技术

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

RAIN-128算法的中间相遇攻击

引用

电子与信息学报 2024年第1期46卷 327-334页

作者：杜小妮郑亚楠梁丽芳李锴彬西北师范大学数学与统计学院兰州730070 西北师范大学密码技术与数据分析重点实验室兰州730070 西北师范大学计算机科学与工程学院兰州730070

RAIN是一族SPN结构的轻量级分组密码算法,该算法具有软硬件实现效率高、安_全性强等特点。中间相遇攻击被广泛应用于分组密码算法的安全性分析中。该文通过分析RAIN-128的结构特性和截断差分特征,利用差分枚举技术分别构造了4轮和6轮中... 详细信息

RAIN是一族SPN结构的轻量级分组密码算法,该算法具有软硬件实现效率高、安_全性强等特点。中间相遇攻击被广泛应用于分组密码算法的安全性分析中。该文通过分析RAIN-128的结构特性和截断差分特征,利用差分枚举技术分别构造了4轮和6轮中间相遇区分器,给出了8轮及10轮的中间相遇攻击。当攻击轮数为8轮时,预计算阶段的时间复杂度为2^(68)次8轮RAIN-128加密,存储复杂度为2^(75)bit,在线攻击阶段的时间复杂度为2^(109)次8轮加密,数据复杂度是2^(72)个选择明文;当攻击轮数为10轮时,预计算阶段的时间复杂度为2^(214)次10轮加密,存储复杂度为2^(219)bit,在线攻击阶段的时间复杂度为2^(109)次10轮加密,数据复杂度是2^(72)个选择明文,分析结果显示,RAIN-128可以抵抗中间相遇攻击,并具有较高的安全冗余。

关键词：分组密码 RAIN-128 中间相遇攻击差分枚举技术

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Linear complexity problems of level sequences of Euler quotients and their related binary sequences

引用

Science China(Information Sciences) 2016年第3期59卷 75-86页

作者： Zhihua NIU Zhixiong CHEN xiaoni du School of Computer Engineering and Science Shanghai University School of Mathematics Putian University College of Mathematics and Information Science Northwest Normal University

The Euler quotient modulo an odd-prime power pr(r > 1) can be uniquely decomposed as a p-adic number of the form(up-1pr-1- 1)/pr≡ a0(u) + a1(u)p + ··· + ar-1(u)pr-1(mod pr), gcd(u, p) = 1, where0≤aj(u) 1. We firstly study certain arithmetic properties of the level sequences(aj(u))u≥0over Fp via introducing a new quotient. Then we determine the exact values of linear complexity of(aj(u))u≥0 and values of k-error linear complexity for binary sequences defined by(aj(u))u≥0.

关键词： cryptography Euler quotients Fermat quotients pseudorandom sequences binary sequences lin ear complexity k-error linear complexity

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

A Class of Linear Codes with Three and Five Weights

引用

Chinese Journal of Electronics 2019年第3期28卷 457-461页

作者： du xiaoni LI Xiaodan WAN Yunqi College of Mathematics and Statistics Northwest Normal University

Linear codes have been an interesting topic in both theory and practice for many years. Based on the theory of defining set, a class of three-weight and five-weight linear codes over prime field Fp are constructed, which is an extension of Wang et al.’s construction. Our construction include some optimal codes and almost optimal codes with respect to the Singleton bounds. We employ exponential sums to investigate the weight distributions of these linear codes. The results show that these codes can be used to construct secret sharing schemes.

关键词： Linear codes Weight distributions Secret sharing schemes Optimal codes

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

On the Linear Complexity of New Generalized Cyclotomic Binary Sequences of Order Two and Period pqr

引用

Tsinghua Science and Technology 2016年第3期21卷 295-301页

作者： Longfei Liu Xiaoyuan Yang xiaoni du Bin Wei Key Laboratory of Network & Information Security of APF Engineering College of APF College of Mathematics and Statistics Northwest Normal University

Periodic sequences over finite fields, constructed by classical cyclotomic classes and generalized cyclotomic classes, have good pseudorandom properties. The linear complexity of a period sequence plays a fundamental role in the randomness of sequences. Let p, q, and r be distinct odd primes with gcd（p-1, q-1 ）=gcd（p- 1, r-1）=gcd（q-1, r-1）=2. In this paper, a new class of generalized cyclotomic sequence with respect to pqr over GF（2） is constructed by finding a special characteristic set. In addition, we determine its linear complexity using cyclotomic theory. Our results show that these sequences have high linear complexity, which means they can resist linear attacks.

关键词： stream cipher pseudorandom sequence generalized cyclotomy linear complexity

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

On the k-error linear complexity of 2p~2-periodic binary sequences

引用

Science China(Information Sciences) 2020年第9期63卷 263-276页

作者： Zhihua NIU Can YUAN Zhixiong CHEN xiaoni du Tao ZHANG School of Computer Engineering and Science Shanghai University College of Mathematics and Statistics Northwest Normal University Provincial Key Laboratory of Applied Mathematics Putian University

Dear editor,Pseudorandom sequences play an important role in cryptography. In particular in symmetric cryptography they serve as the secret key. So the designs of pseudorandom sequences and cryptographic indicators ar...

关键词：

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Linear Complexity of Some Binary Sequences Derived from Fermat Quotients

引用

China Communications 2012年第2期9卷 105-108页

作者： Chen Zhixiong Hu Lei, du xiaoni Department of Mathematics Putian University Putian 351100 P. R. China State Key Laboratory of Information Security Graduate School of Chinese Academy of Sciences Beijing 100049P. R. China College of Mathematics and Information Science Northwest Normal University Lanzhou 730070 P. R. China

We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotients modulo an odd prime *** 2 is a primitive element modulo p2,the linear complexity equals to p2-p or p2-1,which is very close to the period and it is large enough for cryptographic purpose.

关键词： cryptography pseudorandom binary sequences fermat quotients finite fields linear complexity

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

An Underwater Biomimetic Robot that can Swim,Bipedal Walk and Grasp

引用

Journal of Bionic Engineering 2024年第3期21卷 1223-1237页

作者： Qiuxuan Wu Liwei Pan FuLin du ZhaoSheng Wu xiaoni Chi FaRong Gao Jian Wang Anton A.Zhilenkov School of Automation Hangzhou Dianzi UniversityHangzhou310018China International Joint Research Laboratory for Autonomous Robotic Systems Hangzhou310018China GEELY Automotive Institute Hangzhou Vocational and Technical CollegeHangzhou310018China Institute of Hydrodynamics and Control Processes Sankt-Petersburg Saint Petersburg State Marine Technical UniversitySankt-PetersburgRussia

In developing and exploring extreme and harsh underwater environments,underwater robots can effectively replace humans to complete *** meet the requirements of underwater flexible motion and comprehensive subsea operation,a novel octopus-inspired robot with eight soft limbs was designed and *** robot possesses the capabilities of underwater bipedal walking,multi-arm swimming,and grasping *** closely interact with the underwater seabed environment and minimize disturbance,the robot employs a cable-driven flexible arm for its walking in underwater floor through a bipedal walking *** multi-arm swimming offers a means of three-dimensional spatial movement,allowing the robot to swiftly explore and navigate over large areas,thereby enhancing its ***,the robot’s walking arm enables it to grasp and transport objects underwater,thereby enhancing its practicality in underwater environments.A simplified motion models and gait generation strategies were proposed for two modes of robot locomotion:swimming and walking,inspired by the movement characteristics of octopus-inspired multi-arm swimming and bipedal *** experimental verification,the robot’s average speed of underwater bipedal walking reaches 7.26 cm/s,while the horizontal movement speed for multi-arm swimming is 8.6 cm/s.

关键词： Underwater soft robots Underwater bipedal walking Multi-arm swimming Cable drive

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Feedback Mechanism-driven Mutation Reptile Search Algorithm for Optimizing Interpolation Developable Surfaces

引用

Journal of Bionic Engineering 2024年第1期21卷 527-571页

作者： Gang Hu Jiao Wang xiaoni Zhu Muhammad Abbas Department of Applied Mathematics Xi'an University of TechnologyXi'an 710054China School of Mechanical and Precision Instrument Engineering Xi'an University of TechnologyXi'an 710048China Department of Mathematics University of SargodhaSargodha 40100Pakistan

Curvature lines are special and important curves on *** is of great significance to construct developable surface interpolated on curvature lines in engineering *** this paper,the shape optimization of generalized cubic ball developable surface interpolated on the curvature line is studied by using the improved reptile search ***,based on the curvature line of generalized cubic ball curve with shape adjustable,this paper gives the construction method of SGC-Ball developable surface interpolated on the ***,the feedback mechanism,adaptive parameters and mutation strategy are introduced into the reptile search algorithm,and the Feedback mechanism-driven improved reptile search algorithm effectively improves the solving *** IEEE congress on evolutionary computation 2014,2017,2019 and four engineering design problems,the feedback mechanism-driven improved reptile search algorithm is compared with other representative methods,and the result indicates that the solution performance of the feedback mechanism-driven improved reptile search algorithm is *** last,taking the minimum energy as the evaluation index,the shape optimization model of SGC-Ball interpolation developable surface is *** developable surface with the minimum energy is achieved with the help of the feedback mechanism-driven improved reptile search algorithm,and the comparison experiment verifies the superiority of the feedback mechanism-driven improved reptile search algorithm for the shape optimization problem.

关键词： Reptile search algorithm Feedback mechanism Adaptive parameter Mutation strategy SGC-Ball interpolation developable surface Shape optimization

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：