Cover Image

Recovering short generators via negative moments of Dirichlet $L$-functions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ng, Iu-Iong, Toma, Yuichiro
Format:	Preprint
Published:	2024
Subjects:	Number Theory Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Mean square of inverses of Dirichlet $L$-functions involving conductors
by: Ng, Iu-Iong, et al.
Published: (2025)

On Factoring and Power Divisor Problems via Rank-3 Lattices and the Second Vector
by: Gao, Yiming, et al.
Published: (2025)

Multiplication of polynomials over the binary field
by: Liu, Chunlei
Published: (2025)

A Note on Algorithms for Computing $p_n$
by: Aggarwal, Ansh
Published: (2025)

On Polynomial Modular Number Systems over $\mathbb{Z}/p\mathbb{Z}$
by: Bajard, Jean Claude, et al.
Published: (2020)

On Deterministically Finding an Element of High Order Modulo a Composite
by: Oznovich, Ziv, et al.
Published: (2025)

Composition of random functions and word reconstruction
by: Chapuy, Guillaume, et al.
Published: (2026)

An average case efficient algorithm for solving two-variable linear Diophantine equations
by: Deora, Mayank, et al.
Published: (2024)

Pseudo-Deterministic Construction of Irreducible Polynomials over Finite Fields
by: Rai, Shanthanu S
Published: (2024)

A number-theoretic conjecture implying faster algorithms for polynomial factorization and integer factorization
by: Umans, Chris, et al.
Published: (2025)

Deterministically finding an element of large order in $\mathbb{Z}_N^*$
by: Nir, Itamar
Published: (2026)

A Generalized Trace Reconstruction Problem: Recovering a String of Probabilities
by: Rivkin, Joey, et al.
Published: (2024)

Computation of Jacobi sums of order l^2 and 2l^2 with prime l
by: Ahmed, Md. Helal, et al.
Published: (2019)

A degree 4 sum-of-squares lower bound for the clique number of the Paley graph
by: Kunisky, Dmitriy, et al.
Published: (2022)

Recovering Communities in Structured Random Graphs
by: Kapralov, Michael, et al.
Published: (2026)

Module Lattice Security (Part III): Structured CVP Distance on the Log-Unit Lattice
by: Luo, Ming-Xing
Published: (2026)

Dyadically resolving trinomials for fast modular arithmetic
by: Dougherty-Bliss, Robert, et al.
Published: (2025)

On the moments of averages of quadratic twists of the Möbius function
by: Toma, Yuichiro
Published: (2024)

The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings
by: Hou, Jiaxin, et al.
Published: (2023)

Faster single-source shortest paths with negative real weights via proper hop distance
by: Huang, Yufan, et al.
Published: (2024)

An Algorithm to Find Sums of Powers of Consecutive Primes
by: O'Sullivan, Cathal, et al.
Published: (2022)

Showcasing straight-line programs with memory via matrix Bruhat decomposition
by: Niemeyer, Alice C., et al.
Published: (2013)

Universal Maximum Likelihood (List) Decoding via Fast Vector-Matrix Multiplication
by: Ly, Hoang, et al.
Published: (2025)

List Decoding Expander-Based Codes via Fast Approximation of Expanding CSPs: I
by: Jeronimo, Fernando Granha, et al.
Published: (2025)

Faster negative length shortest paths by bootstrapping hop reducers
by: Huang, Yufan, et al.
Published: (2025)

A short note about the learning-augmented secretary problem
by: Choo, Davin, et al.
Published: (2024)

Recursive lattice reduction -- A framework for finding short lattice vectors
by: Aggarwal, Divesh, et al.
Published: (2023)

Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time
by: Harris, David G.
Published: (2023)

Entropic independence via sparse localization
by: Jain, Vishesh, et al.
Published: (2026)

Moments of quadratic Dirichlet character sums
by: Toma, Yuichiro
Published: (2025)

A probabilistic analysis on general probabilistic scheduling problems
by: Suruga, Daiki
Published: (2024)

Key Compression Limits for $k$-Minimum Value Sketches
by: Dickens, Charlie, et al.
Published: (2024)

Capacity-Achieving Gray Codes
by: Guruswami, Venkatesan, et al.
Published: (2024)

Robust Gray Codes Approaching the Optimal Rate
by: Con, Roni, et al.
Published: (2024)

Investigations on Algorithm Selection for Interval-Based Coding Methods
by: Strutz, Tilo, et al.
Published: (2024)

Finite matrix multiplication algorithms from infinite groups
by: Blasiak, Jonah, et al.
Published: (2024)

Graph Reconstruction from Noisy Random Subgraphs
by: McGregor, Andrew, et al.
Published: (2024)

More basis reduction for linear codes: backward reduction, BKZ, slide reduction, and more
by: Ghentiyala, Surendra, et al.
Published: (2024)

Continuous Optimization for Decoding Errors
by: Srivastava, Shashank
Published: (2024)

Towards Optimal Grammars for RNA Structures
by: Onokpasa, Evarista, et al.
Published: (2024)