arXiv cs/03080272003-08cs.CRcs.DMmath.CO

基于拉丁方和RSA的秘密共享方案的比较

A Comparison of Secret Sharing Schemes Based on Latin Squares and RSA

Liam Wagner

摘要：

近年来，人们对秘密共享方案做了大量的研究。秘密共享方案允许密钥的划分，以便授权的用户可以访问信息。在本文中，我们希望提出一个关键的比较，这些计划的基础上拉丁广场，[库珀等，]和RSA [Shoup]。这两项议定书将从其合法性的积极和消极方面加以审查。

英文摘要：

In recent years there has been a great deal of work done on secret sharing scehemes. Secret Sharing Schemes allow for the division of keys so that an authorised set of users may access information. In this paper we wish to present a critical comparison of two of these schemes based on Latin Squares, [Cooper et., al.] and RSA [Shoup]. These two protocols will be examined in terms of their positive and negative aspects of their secuirty.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

摘要英文摘要相关论文

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

继续探索

相关论文

一种改进的基于拉丁方的秘密共享方案

Improved Latin Square based Secret Sharing Scheme

本文首先回顾了密码学中散列函数、秘密共享方案和拉丁方的一些基本性质。然后讨论了为什么拉丁方或其临界集是秘密表示的好选择，以及它与秘密共享方案的关系。此外，我们列举了拉丁方在秘密共享方案中的局限性。最后，我们提出如何应用密码散列函数，羊群攻击技术的拉丁方为基础的秘密共享方案，以克服这些限制。

2011-07-10cs.CR

连分数与小秘密指数的RSA

Continued fractions and RSA with small secret exponent

推广了经典的Legendre结果，给出了该不等式的所有解|x - a/b| < c/b^2，根据x的连分式展开的收敛性。也就是说，我们证明了对于某些非负整数m，r，s，使得rs < 2c，a/b =（rp_{m+1} +- sp_m）/（rq_{m+1} +- sq_m）.作为这一结果的应用，我们描述了一个修改的Verheul和van Tilborg变体的维纳攻击的RSA密码系统的小秘密指数。

2004-02-20cs.CRmath.NT

$2^t$元RSA预计算中的双重计数揭示秘密指数

Double Counting in $2^t$-ary RSA Precomputation Reveals the Secret Exponent

针对经典RSA数字签名的$2^t$进制模幂运算的预计算问题，提出了一种新的故障攻击--双重计数攻击（DCA），没有中国剩余定理的RSA）。$2^t$ -元方法是最流行和广泛使用的加速RSA签名过程的算法。开发人员可以通过选择最佳的$t$来实现最快的签名过程。例如，$t=6$最适合1536位经典RSA实现。$2^t$ -ary方法需要预计算以生成消息的小指数。尽管预计算可以成为故障攻击的目标，但传统的故障攻击研究很少关注预计算。该算法利用指令跳跃技术，在预计算中引入错误，相当于用汇编语言中的no操作代替指令。本文还提出了一个有用的“位置检查器”的工具，以确定的$2^t$ -ary系数的秘密指数的签名的基础上错误的预计算的位置。结果表明，DCA是一种有效的参数攻击方法.对于使用$2^6$ -ary方法的1536位RSA实现，DCA可以使用具有$63(=2^6-1)$故障签名的位置检查器在短时间内重建整个秘密指数。DCA过程可以针对小的公共指数（例如，65537）。据我们所知，提出的DCA是第一个针对经典RSA预计算的故障攻击。

2014-07-28cs.CR

基于自平行同构的拉丁方临界集

Critical sets of Latin squares based on autoparatopisms

Universidad de Sevilla（塞维利亚大学）

本文针对秘密共享中临界集信息持有者缺失问题，提出利用拉丁方自平行同构群轨道计算临界集，并据此设计新秘密共享方案。

2026-09-21cs.CRmath.CO

Wiener对RSA攻击的一个变种

A variant of Wiener's attack on RSA

维纳攻击是对具有小秘密解密指数d的RSA密码系统的众所周知的多项式时间攻击，其在d<n^{0.25}时有效，其中n=pq是密码系统的模。也就是说，在这种情况下，d是e/n的连分数展开式的某个收敛p_m/q_m的分母，因此可以从公钥（n，e）有效地计算d。维纳攻击有几种扩展，当d比n^{0.25}长几位时，可以破解RSA密码系统。它们都有运行时复杂度（至少）O（D^2），其中d=Dn^{0.25}。在这里，我们提出了一个新的变种维纳攻击，它使用的结果丢番图近似的形式|α- p/q| < c/q^2，以及用于测试秘密指数的候选（形式为rq_{m+1} + sq_m）的“中间相遇”变体。这将攻击的运行时间复杂度降低到O（D log（D））（空间复杂度为O（D））。

2008-11-01cs.CR

Constructing Orthogonal Latin Squares from Linear Cellular Automata

We undertake an investigation of combinatorial designs engendered by cellular automata (CA), focusing in particular on orthogonal Latin squares and orthogonal arrays. The motivation is of cryptographic nature. Indeed, we consider the problem of employing CA to define threshold secret sharing schemes via orthogonal Latin squares. We first show how to generate Latin squares through bipermutive CA. Then, using a characterization based on Sylvester matrices, we prove that two linear CA induce a pair of orthogonal Latin squares if and only if the polynomials associated to their local rules are rela…

2016-10-01cs.CRcs.DMcs.FL

更多相关论文收起更多论文

如何重建（匿名）一个秘密细胞自动机

How to reconstruct (anonymously) a secret cellular automaton

University of Twente（特文特大学）；University of Trieste（的里雅斯特大学）；University of Milano-Bicocca（米兰比可卡大学）

本文基于细胞自动机研究了阈值秘密共享方案，提出通过拉丁方族定义秘密空间，实现秘密规则的匿名重建，并讨论了共享秘密细胞自动机数量与恢复阶段计算复杂度的权衡。

2026-04-13cs.CRmath.CO

Multilevel Threshold Secret and Function Sharing based on the Chinese Remainder Theorem

A recent work of Harn and Fuyou presents the first multilevel (disjunctive) threshold secret sharing scheme based on the Chinese Remainder Theorem. In this work, we first show that the proposed method is not secure and also fails to work with a certain natural setting of the threshold values on compartments. We then propose a secure scheme that works for all threshold settings. In this scheme, we employ a refined version of Asmuth-Bloom secret sharing with a special and generic Asmuth-Bloom sequence called the {\it anchor sequence}. Based on this idea, we also propose the first multilevel conj…

2016-05-25cs.CR

Hip to Be (Latin) Square: Maximal Period Sequences from Orthogonal Cellular Automata

Orthogonal Cellular Automata (OCA) have been recently investigated in the literature as a new approach to construct orthogonal Latin squares for cryptographic applications such as secret sharing schemes. In this paper, we consider OCA for a different cryptographic task, namely the generation of pseudorandom sequences. The idea is to iterate a dynamical system where the output of an OCA pair is fed back as a new set of coordinates on the superposed squares. The main advantage is that OCA ensure a certain amount of diffusion in the generated sequences, a property which is usually missing from tr…

2021-06-14cs.CRcs.DMcs.FL

New (k,l,m)-verifiable multi-secret sharing schemes based on XTR public key system

Secret sharing was proposed primarily in 1979 to solve the problem of key distribution. In recent decades, researchers have proposed many improvement schemes. Among all these schemes, the verifiable multi-secret sharing (VMSS) schemes are studied sufficiently, which share multiple secrets simultaneously and perceive malicious dealer as well as participants. By pointing out that the schemes presented by Dehkordi and Mashhadi in 2008 cannot detect some vicious behaviors of the dealer, we propose two new VMSS schemes by adding validity check in the verification phase to overcome this drawback. Ou…

2020-11-17cs.CRcs.SI

基于欺骗检测的CTS秘密图像共享

Secret Image Sharing Based CTS with Cheating Detection

支票截断系统（CTS）是RBI实施的自动支票清算系统。CTS使用支票图像而不是支票本身进行支票清算，从而大大减少了周转时间。这种方法阻止了支票从提示行到付款行的物理移动。在CTS中，支票的数字图像使用标准的公钥和对称密钥保护，如RSA，三重DES等，这涉及到大量的计算开销和密钥管理。安全性也依赖于数学难题，仅是计算安全的.信息理论上安全的秘密图像共享技术可以用于CTS中，以安全有效地处理支票图像.本文提出了两个简单有效的秘密图像共享方案和基于这些算法的支票截断系统.在该方案中，提示行作为交易商，参与者为客户和付款行，交易商生成支票份额并分发给客户和付款行，在重构过程中，份额的有效性是重要的。该方案还提出了一种作弊检测方法，该方法使用散列技术来识别客户提交的任何无效份额。实验结果表明，与现有方案相比，该方案具有高效性和安全性。

2015-02-26cs.CR

Chaotic Dynamic S Boxes Based Substitution Approach for Digital Images

In this paper, we propose an image encryption algorithm based on the chaos, substitution boxes, nonlinear transformation in Galois field and Latin square. Initially, the dynamic S boxes are generated using Fisher Yates shuffle method and piece wise linear chaotic map. The algorithm utilizes advantages of keyed Latin square and transformation to substitute highly correlated digital images and yield encrypted image with valued performance. The chaotic behavior is achieved using Logistic map which is used to select one of thousand S boxes and also decides the row and column of selected S box. The…

2017-09-22cs.CR