arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.02631math.PRcs.CR
收藏

强平稳时间及其在密码学中的应用

Strong stationary times and its use in cryptography

Paweł Lorek, Filip Zagórski, Michał Kulis

摘要:

本文介绍了强平稳时间(SST)技术在密码学领域的适用性。适用性是在三个领域:*)一类新的密码算法(伪随机置换生成器),不运行预定义的步骤数的命题。相反,这些算法根据定义为SST的停止规则停止,可以获得可证明的性质:* 结果是来自均匀分布的完美样本,* 定时攻击免疫(没有关于由此产生的置换的信息通过关于步骤SST算法的数量的信息泄漏 *)我们展示了如何利用基于SST的算法的属性来构建实现(对称加密方案)通过重用对定时攻击不安全的实现而对定时攻击免疫。在对称密钥密码学中,研究人员主要关注常数时间(重)实现。我们的方法走在一个不同的方向,探索输入掩蔽的想法。* )分析现有密码方案的理想化(数学)模型--即,我们改进了Mironov的结果((Not So)Random Shuffles of RC 4; Advances in Cryptology --NIPPTO 2002)

英文摘要:

This paper presents applicability of Strong Stationary Times (SST) techniques in the area of cryptography. The applicability is in three areas: *) Propositions of a new class of cryptographic algorithms (pseudo-random permutation generators) which do not run for the predefined number of steps. Instead, these algorithms stop according to a stopping rule defined as SST, for which one can obtain provable properties: *** results are perfect samples from uniform distribution, *** immunity to timing attacks (no information about the resulting permutation leaks through the information about the number of steps SST algorithm *) We show how one can leverage properties of SST-based algorithms to construct an implementation (of a symmetric encryption scheme) which is immune to the timing-attack by reusing implementations which are not secure against timing-attacks. In symmetric key cryptography researchers mainly focus on constant time (re)implementations. Our approach goes in a different direction and explores ideas of input masking. *) Analysis of idealized (mathematical) models of existing cryptographic schemes -- i.e., we improve a result by Mironov ((Not So) Random Shuffles of RC4; Advances in Cryptology -- CRYPTO 2002)

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑