首页> 外文期刊>Journal of mathematical cryptology >Designing Efficient Dyadic Operations for Cryptographic Applications
【24h】

Designing Efficient Dyadic Operations for Cryptographic Applications

机译:为加密应用设计高效的二元操作

获取原文
获取原文并翻译 | 示例
           

摘要

Cryptographic primitives from coding theory are some of the most promising candidates for NIST's Post-Quantum Cryptography Standardization process. In this paper, we introduce a variety of techniques to improve operations on dyadic matrices, a particular type of symmetric matrices that appear in the automorphism group of certain linear codes. Besides the independent interest, these techniques find an immediate application in practice. In fact, one of the candidates for the Key Exchange functionality, called DAGS, makes use of quasi-dyadic matrices to provide compact keys for the scheme.
机译:编码理论中的密码原语是NIST后量子密码标准化过程中最有希望的候选者之一。在本文中,我们介绍了各种技术来改进并矢矩阵的运算,并矢矩阵是一种特殊类型的对称矩阵,出现在某些线性码的自同构群中。除了独立的兴趣之外,这些技术在实践中也能立即得到应用。事实上,密钥交换功能的候选者之一DAG利用准并矢矩阵为方案提供紧凑的密钥。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号