New pseudorandom functions based on SIS
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 secon...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2014-10-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.10.016/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539747433938944 |
|---|---|
| author | He-feng CHEN Wen-ping MA Sheng GAO Cheng-li ZHANG |
| author_facet | He-feng CHEN Wen-ping MA Sheng GAO Cheng-li ZHANG |
| author_sort | He-feng CHEN |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-8ca9ecada7324f12960dde7ed492e89e |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2014-10-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-8ca9ecada7324f12960dde7ed492e89e2025-01-14T06:44:24ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2014-10-013513814459686911New pseudorandom functions based on SISHe-feng CHENWen-ping MASheng GAOCheng-li ZHANGPseudorandom 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.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.10.016/pseudorandom functionlatticeshort integral solution problemhybrid argument |
| spellingShingle | He-feng CHEN Wen-ping MA Sheng GAO Cheng-li ZHANG New pseudorandom functions based on SIS Tongxin xuebao pseudorandom function lattice short integral solution problem hybrid argument |
| title | New pseudorandom functions based on SIS |
| title_full | New pseudorandom functions based on SIS |
| title_fullStr | New pseudorandom functions based on SIS |
| title_full_unstemmed | New pseudorandom functions based on SIS |
| title_short | New pseudorandom functions based on SIS |
| title_sort | new pseudorandom functions based on sis |
| topic | pseudorandom function lattice short integral solution problem hybrid argument |
| url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.10.016/ |
| work_keys_str_mv | AT hefengchen newpseudorandomfunctionsbasedonsis AT wenpingma newpseudorandomfunctionsbasedonsis AT shenggao newpseudorandomfunctionsbasedonsis AT chenglizhang newpseudorandomfunctionsbasedonsis |