Score:1

[About parameters effect LWE and SIS to be computation or perfect secure]

cn flag

Hello I am new to lattice cryptography I am reading the paper More Efficient Commitments from Structured Lattice Assumptions
They define bound B in page 3
enter image description here

Then In figure 1 in page 9
enter image description here


Can someone kindly explain why the bound increase/decrease will change the LWE/SIS from computation hard to statistical hard? (It seems to me it make sense that the changing of bound will effect the hardness, but I can not get why it will change it from computation hard to statistical hard)
TIA
I sit in a Tesla and translated this thread with Ai:

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.