检索结果-南通市图书馆

Further Analysis of Block Ciphers against timing attacks

Wuhan University Journal of Natural Sciences 2006年第6期11卷 1629-1632页

作者： LI Wei GU Dawu School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai 200030 China State Key Laboratory of Modern Communications Chengdu 610041 Sichuan China

timing attacks break a cryptosystem by time measurement to recover keys. Most available countermeasures protect block ciphers based on the safety of modules. This paper gives a complete definition of timing attacks and studies the vulnerability of operations and modules on timing attacks. We present a method to transfer the security of the algorithm to that of secure operations by reduction. As a result, we hopefully tend to reconcile the provable security notions and modem cryptography with real-world implementations of block ciphers.

关键词： timing attacks block ciphers reduction

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Information Theoretic Distinguishers for timing attacks with Partial Profiles: Solving the Empty Bin Issue

引用

Journal of Information Security 2021年第1期12卷 1-33页

作者： Eloi De Chérisey Sylvain Guilley Olivier Rioul Darshana Jayasinghe LTCI Télécom Paris Institut Polytechnique de Paris France Secure-IC S.A.S Tour Montparnasse Paris France

In any side-channel attack, it is desirable to exploit all the available leakage data to compute the distinguisher’s values. The profiling phase is essential to obtain an accurate leakage model, yet it may not be exhaustive. As a result, information theoretic distinguishers may come up on previously unseen data, a phenomenon yielding empty bins. A strict application of the maximum likelihood method yields a distinguisher that is not even sound. Ignoring empty bins reestablishes soundness, but seriously limits its performance in terms of success rate. The purpose of this paper is to remedy this situation. In this research, we propose six different techniques to improve the performance of information theoretic distinguishers. We study them thoroughly by applying them to timing attacks, both with synthetic and real leakages. Namely, we compare them in terms of success rate, and show that their performance depends on the amount of profiling, and can be explained by a bias-variance analysis. The result of our work is that there exist use-cases, especially when measurements are noisy, where our novel information theoretic distinguishers (typically the soft-drop distinguisher) perform the best compared to known side-channel distinguishers, despite the empty bin situation.

关键词： timing attacks Profiling attacks Dirichlet Priors Success Rates

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Generic,efficient and isochronous Gaussian sampling over the integers

引用

Cybersecurity 2022年第3期5卷 52-73页

作者： Shuo Sun Yongbin Zhou Yunfeng Ji Rui Zhang Yang Tao Institute of Information Engineering Chinese Academy of SciencesBeijingChina School of Cyber Security University of Chinese Academy of SciencesBeijingChina School of Cyber Science and Engineering Nanjing University of Science and TechnologyNanjingChina

Gaussian sampling over the integers is one of the fundamental building blocks of lattice-based *** the extensively used trapdoor sampling algorithms,it is ineluctable until *** the influence of numerous side-channel attacks,it is still challenging to construct a Gaussian sampler that is generic,efficient,and resistant to timing *** this paper,our contribution is ***,we propose a secure,efficient exponential Bernoulli sampling *** can be applied to Gaussian samplers based on rejection *** apply it to FALCON,a candidate of round 3 of the NIST post-quantum cryptography standardization project,and reduce its signature generation time by 13–14%.Second,we develop an isochronous Gaussian sampler based on rejection *** Algorithm can securely sample from Gaussian distributions with different standard deviations and arbitrary *** apply it to PALISADE(S&P 2018),an open-source lattice-based cryptography *** the online phase of trapdoor sampling,the running time of the G-lattice sampling algorithm is reduced by 44.12%while resisting timing ***,we improve the efficiency of the COSAC sampler(PQC 2020).The new COSAC sampler is 1.46x-1.63x faster than the original and has the lowest expected number of trials among all Gaussian samplers based on rejection *** it needs a more efficient algorithm sampling from the normal distribution to improve its performance.

关键词： Lattice-based cryptography Gaussian sampler Rejection sampling timing attacks Trapdoor

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：