Deterministic information loss yields TC0 post-quantum pseudorandomness from lattices
Learning with algebraic rounding achieves TC0 pseudorandomness from quantum worst-case lattice hardness with fixed polynomial parameters.
0 stories this week · 1 this month · 1 in 6 months · mostly security
1 stories, newest first · one card per story
Learning with algebraic rounding achieves TC0 pseudorandomness from quantum worst-case lattice hardness with fixed polynomial parameters.
Today 1.5K readers · 2.4K views · 757 reads · all time 189K views