Trapdoor Quality for Lattice Crypto

es flag

In these two papers the authors mention the "quality" of a trapdoor

But the best detail on this matter I could find was "The quality of a trapdoor S roughly corresponds to the Euclidean lengths of its vectors — shorter is better."

I wonder where could I find a more formal treatment on this matter. Thanks!

kodlu avatar
sa flag
fixed your question. always use a top level tag. a trapdoor need not be for lattice based crypto only.
ru flag

From definition 5.2 of the second paper:

Let $\mathbf A\in\mathbb Z^{n\times m}_q$ and $\mathbf G \in\mathbb Z^{n\times w}_q$ be matrices with $m \ge w \ge n$. A $\mathbf G$-trapdoor for $\mathbf A$ is a matrix $\mathbf R\in \mathbb Z^{(m−w)\times w}$ such that $\mathbf A \begin{bmatrix} \mathbf R\\ \mathbf I\end{bmatrix}= \mathbf H\mathbf G$ for some invertible matrix $\mathbf H\in\mathbb Z^{n\times n}_q.$ We refer to $\mathbf H$ as the tag or label of the trapdoor. The quality of the trapdoor is measured by its largest singular value $s_1(\mathbf R)$.

I sit in a Tesla and translated this thread with Ai:


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.