通信学报
• 论文II • 上一篇 下一篇
陈和风,马文平,张成丽,高 胜
出版日期:
发布日期:
基金资助:
Online:
Published:
摘要: 伪随机函数是构造密码原型的重要工具。基于短整数解问题,在格上设计出2个伪随机函数,第一个利用树状伪随机综合器的思想,达到并行化效果,第二个虽是串行构造,但降低了公钥尺寸。二者均具有小模数,而且是可证明安全的。与A Banerjer,C Peikert和A Rosen 3人提出的方案(EUROCRYPT 2012)相比,此提出的伪随机函数具有渐少的密钥量;在构造方法上,由于避免了凑整技术的使用,伪随机函数的生成效率得到了提高。
Abstract: Pseudorandom functions are vital tools in the construction of cryptographic primitives. Under the hard assumption of SIS (short integer solution), two lattice-based pseudorandom functions are proposed. The first one has parallel structure by the ideal of tree-like pseudorandom synthesizer, and the second one is serial structure whose public key size is reduced. Both constructions have small modulus and provable security. Compared with A Banerjer, C Peikert and A Rosen’s construction (EUROCRYPT 2012), their key sizes are asymptotically smaller, and efficiency are improved by avoiding the “rounding” technology.
陈和风,马文平,张成丽,高 胜. 基于短整数解问题的伪随机函数新构造[J]. 通信学报.
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.infocomm-journal.com/txxb/CN/
https://www.infocomm-journal.com/txxb/CN/Y2014/V35/I10/16