Solving the learning parity with noise's open question
The classical cryptographic primitives are constructed on the assumptions that the private key is securely kept and uniformly distributed. Learning parity with noise is a famous problem used to construct several cryptographic primitives. This research studies the open question about the hardness of...
Saved in:
Main Authors: | Vasin Suttichaya, Pattarasinee Bhattarakosol |
---|---|
其他作者: | Mahidol University |
格式: | Article |
出版: |
2018
|
主題: | |
在線閱讀: | https://repository.li.mahidol.ac.th/handle/123456789/31643 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Mahidol University |
相似書籍
-
Desktop tower defense is NP-hard
由: Vasin Suttichaya
出版: (2018) -
Open domain question answering system
由: Hoang, Nghia Tuyen
出版: (2022) -
Analyzing SQL Injection Statements Using Common Substructure of Parse Tree
由: Warradorn Sirisang, et al.
出版: (2019) -
Complexity Reduction on API Call Sequence Alignment Using Unique API Word Sequence
由: Thotsaphon Tungjitviboonkun, et al.
出版: (2019) -
The Fuzzy Scheduling Algorithm for the Parallel Key Searching Problem on Cloud Environment
由: Pimsiri Tubthong, et al.
出版: (2019)