【24h】

Looking beyond XTR

机译:超越XTR

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

摘要

XTR is a general method that can be applied to discrete logarithm based cryptosystems in extension fields of degree six, providing a compact representation of the elements involved. In this paper we present a precise formulation of the Brouwer-Pellikaan-Verheul conjecture, originally posed in, concerning the size of XTR-like representations of elements in extension fields of arbitrary degree. If true this conjecture would provide even more compact representations of elements than XTR in extension fields of degree thirty. We test the conjecture by experiment, showing that in fact it is unlikely that such a compact representation of elements can be achieved in extension fields of degree thirty.
机译:XTR是一种通用方法,可以将其应用于六阶扩展字段中的基于离散对数的密码系统,从而提供所涉及元素的紧凑表示。在本文中,我们提出了最初提出的Brouwer-Pellikaan-Verheul猜想的精确公式,该猜想涉及任意程度扩展域中元素的XTR表示形式的大小。如果为真,则此猜想将在三十度扩展字段中提供比XTR更为紧凑的元素表示。我们通过实验测试该猜想,表明实际上不可能在三十度的扩展域中实现这种紧凑的元素表示。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号