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 |
---|---|
Other Authors: | Mahidol University |
Format: | Article |
Published: |
2018
|
Subjects: | |
Online Access: | https://repository.li.mahidol.ac.th/handle/123456789/31643 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Mahidol University |
Similar Items
-
Desktop tower defense is NP-hard
by: Vasin Suttichaya
Published: (2018) -
Open domain question answering system
by: Hoang, Nghia Tuyen
Published: (2022) -
Analyzing SQL Injection Statements Using Common Substructure of Parse Tree
by: Warradorn Sirisang, et al.
Published: (2019) -
Complexity Reduction on API Call Sequence Alignment Using Unique API Word Sequence
by: Thotsaphon Tungjitviboonkun, et al.
Published: (2019) -
The Fuzzy Scheduling Algorithm for the Parallel Key Searching Problem on Cloud Environment
by: Pimsiri Tubthong, et al.
Published: (2019)