mirror of
https://github.com/lux-apps/papers.git
synced 2026-10-30 18:15:21 +00:00
zeekay
9504b4c3ef
Sweep across the non-Tier-1 paper catalogue (Tier-1 owned by parallel
agent and excluded). All 113 processed papers already had luxcover
wired up; this commit fixes 14 build breakers and produces fresh
PDFs across the catalogue.
Fixes:
- lux-blockchain-scaling-laws: em-dash inside lstlisting -> --
- lux-corona-pq: stale \input pointing at 03-the-corona-scheme renamed
to 03-the-corona-scheme (file already renamed on disk)
- lux-lattice-cryptography-primer: same Corona->Corona rename
- lux-formal-verification-lean4: Lean source uses unicode (×, ∀, ∃, ∈,
∧, ∨, ∩, ≠, ⟨, ⟩, ·, ¬) inside lstlistings. Added a literate map
so listings render the math glyphs without UTF-8 fault.
- lux-id-did-specification: ✓/✗ in tabular replaced with \ding{51}
/ \ding{55} (pifont). Added pifont package.
- lux-ntt-simd-implementation: middle-dot in Go assembly listings;
added literate {·}{\textperiodcentered}.
- lux-ntt-transform: μ, ×, –, — in regular text (no T1 fontenc).
Replaced with $\mu$/$\times$/--/--- via unicode->latex sweep.
- lux-perpetuals-derivatives, lux-quantum-consensus,
lux-quasar-consensus, lux-tee-computing-mesh: same unicode->latex
sweep across body text. Also fixed broken math segment
`$L_{avg} = 10$\times$$` -> `$L_{avg} = 10\times$`.
- lux-zchain: emoji glyphs in roadmap table replaced with
parenthetical text.
- lux-triple-proof-consensus: dropped duplicate \usepackage{geometry}
that clashed with luxcover (geometry option clash).
- pq: defined missing \Rq macro.
PDFs rebuilt for the full Tier-2/3 set.
Excluded (Tier-1, parallel agent): lp-073-pulsar, lp-stricte2epq,
dag-evm-formal, lp-010-quasar-stm-{3,4}, lp-020-quasar-consensus,
lux-institutional-custody, lux-nist-mptc-submission, pqsafe-il5,
pq-rns, plus shared/ and lps/.
51 lines
1.5 KiB
TeX
51 lines
1.5 KiB
TeX
\section{Security Analysis}
|
|
|
|
|
|
\subsection{Quantum Attack Resistance}
|
|
|
|
\subsubsection{Grover's Algorithm}
|
|
Grover's algorithm provides quadratic speedup for brute-force search:
|
|
\begin{itemize}
|
|
\item Classical security: $2^n$ operations
|
|
\item Quantum security: $2^{n/2}$ operations
|
|
\item Mitigation: Double key sizes (256-bit -> 512-bit)
|
|
\end{itemize}
|
|
|
|
\subsubsection{Shor's Algorithm}
|
|
Shor's algorithm breaks discrete log and factoring in polynomial time:
|
|
\begin{itemize}
|
|
\item Impact: Complete break of ECC and RSA
|
|
\item Timeline: 10-15 years for cryptographically relevant quantum computers
|
|
\item Mitigation: Lattice-based cryptography (immune to Shor)
|
|
\end{itemize}
|
|
|
|
\subsection{Classical Security}
|
|
|
|
The security of lattice-based cryptography relies on:
|
|
|
|
\begin{enumerate}
|
|
\item \textbf{Learning With Errors (LWE)}: Distinguishing noisy linear combinations
|
|
\item \textbf{Short Integer Solution (SIS)}: Finding short vectors in lattices
|
|
\item \textbf{NTRU assumption}: Specific to FALCON
|
|
\end{enumerate}
|
|
|
|
These problems have resisted classical attacks for decades and are believed quantum-hard.
|
|
|
|
\subsection{Implementation Security}
|
|
|
|
\subsubsection{Timing Attacks}
|
|
Our implementation uses constant-time operations:
|
|
\begin{itemize}
|
|
\item No data-dependent branches
|
|
\item Fixed iteration counts
|
|
\item Constant-time modular arithmetic
|
|
\end{itemize}
|
|
|
|
\subsubsection{Side-Channel Resistance}
|
|
\begin{itemize}
|
|
\item Power analysis: Mitigated by EVM abstraction
|
|
\item Cache timing: Not applicable to EVM
|
|
\item Electromagnetic emanation: Hardware-dependent
|
|
\end{itemize}
|
|
|