...
首页> 外文期刊>Designs, Codes and Crytography >Towards a Uniform Description of Several Group Based Cryptographic Primitives
【24h】

Towards a Uniform Description of Several Group Based Cryptographic Primitives

机译:对几种基于组的密码基元的统一描述

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

摘要

The public key cryptosystems MST_1 and MST_2 make use of certain kinds of factorizations of finite groups. We show that generalizing such factorizations to infinite groups allows a uniform description of several proposed cryptographic primitives. In particular, a generalization of MST_2 can be regarded as a unifying framework for several suggested cryptosystems including the ElGamal public key system, a public key system based on braid groups, and the MOR cryptosystem.
机译:公钥密码系统MST_1和MST_2利用有限组的某些因式分解。我们表明,将这样的因式分解推广到无限组可以对几个提议的密码原语进行统一描述。特别是,MST_2的泛化可以被视为几种建议的密码系统的统一框架,其中包括ElGamal公钥系统,基于辫子组的公钥系统和MOR密码系统。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号