Imagen de Portada

An average case efficient algorithm for solving two-variable linear Diophantine equations

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Deora, Mayank, Pal, Pinakpani
Formato:	Preprint
Publicado:	2024
Materias:	Cryptography and Security Data Structures and Algorithms Number Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Efficient algorithm for linear diophantine equations in two variables
por: Deora, Mayank, et al.
Publicado: (2025)

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

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

The state hidden subgroup problem and an efficient algorithm for locating unentanglement
por: Bouland, Adam, et al.
Publicado: (2024)

Differentially Private Ad Conversion Measurement
por: Delaney, John, et al.
Publicado: (2024)

Meeting Utility Constraints in Differential Privacy: A Privacy-Boosting Approach
por: Jiang, Bo, et al.
Publicado: (2024)

Low-degree Security of the Planted Random Subgraph Problem
por: Bogdanov, Andrej, et al.
Publicado: (2024)

Concurrent Composition for Interactive Differential Privacy with Adaptive Privacy-Loss Parameters
por: Haney, Samuel, et al.
Publicado: (2023)

Compression with Privacy-Preserving Random Access
por: Chandar, Venkat, et al.
Publicado: (2025)

Necessity of Block Designs for Optimal Locally Private Distribution Estimation
por: Gentle, Abigail
Publicado: (2025)

Shuffling Cards When You Are of Very Little Brain: Low Memory Generation of Permutations
por: Menuhin, Boaz, et al.
Publicado: (2025)

Almost Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy
por: Dong, Wei, et al.
Publicado: (2024)

Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing
por: Goodrich, Michael T., et al.
Publicado: (2024)

Individualized Privacy Accounting via Subsampling with Applications in Combinatorial Optimization
por: Ghazi, Badih, et al.
Publicado: (2024)

Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More
por: Chandra, Rishi, et al.
Publicado: (2024)

Adversary Resilient Learned Bloom Filters
por: Almashaqbeh, Ghada, et al.
Publicado: (2024)

On Learning Parities with Dependent Noise
por: Golowich, Noah, et al.
Publicado: (2024)

Differentially Private Substring and Document Counting with Near-Optimal Error
por: Bernardini, Giulia, et al.
Publicado: (2024)

On Wagner's k-Tree Algorithm Over Integers
por: Lin, Haoxing, et al.
Publicado: (2024)

Fine-Grained Privacy Guarantees for Coverage Problems
por: Dhulipala, Laxman, et al.
Publicado: (2024)

Near-Universally-Optimal Differentially Private Minimum Spanning Trees
por: Hladík, Richard, et al.
Publicado: (2024)

Sublinear Space Graph Algorithms in the Continual Release Model
por: Epasto, Alessandro, et al.
Publicado: (2024)

Improved Lower Bound for Differentially Private Facility Location
por: Manurangsi, Pasin
Publicado: (2024)

Profile Reconstruction from Private Sketches
por: Wu, Hao, et al.
Publicado: (2024)

Continual Counting with Gradual Privacy Expiration
por: Andersson, Joel Daniel, et al.
Publicado: (2024)

Count on Your Elders: Laplace vs Gaussian Noise
por: Andersson, Joel Daniel, et al.
Publicado: (2024)

Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues
por: Thießen, Thore, et al.
Publicado: (2024)

Differential privacy and Sublinear time are incompatible sometimes
por: Blocki, Jeremiah, et al.
Publicado: (2024)

Improving Lagarias-Odlyzko Algorithm For Average-Case Subset Sum: Modular Arithmetic Approach
por: Joux, Antoine, et al.
Publicado: (2024)

A Persistent Hierarchical Bloom Filter-based Framework for Authentication and Tracking of ICs
por: Shishir, Fairuz Shadmani, et al.
Publicado: (2024)

An Affine Equivalence Algorithm for S-boxes based on Matrix Invariants
por: Hu, Xincheng, et al.
Publicado: (2024)

Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph
por: Henzinger, Monika, et al.
Publicado: (2024)

Fully Dynamic Graph Algorithms with Edge Differential Privacy
por: Raskhodnikova, Sofya, et al.
Publicado: (2024)

Time-Aware Projections: Truly Node-Private Graph Statistics under Continual Observation
por: Jain, Palak, et al.
Publicado: (2024)

Private Synthetic Data Generation in Bounded Memory
por: Holland, Rayne, et al.
Publicado: (2024)

An Efficient and Scalable Auditing Scheme for Cloud Data Storage using an Enhanced B-tree
por: Islam, Tariqul, et al.
Publicado: (2024)

Private Counting of Distinct Elements in the Turnstile Model and Extensions
por: Henzinger, Monika, et al.
Publicado: (2024)

Differential Privacy with Multiple Selections
por: Goel, Ashish, et al.
Publicado: (2024)

Better Gaussian Mechanism using Correlated Noise
por: Lebeda, Christian Janos
Publicado: (2024)

Decentralized Privacy Preservation for Critical Connections in Graphs
por: Li, Conggai, et al.
Publicado: (2024)