Copertina

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

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Deora, Mayank, Pal, Pinakpani
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Cryptography and Security Data Structures and Algorithms Number Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

Differentially Private Ad Conversion Measurement
di: Delaney, John, et al.
Pubblicazione: (2024)

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

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

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

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

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

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

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

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

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

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

Adversary Resilient Learned Bloom Filters
di: Almashaqbeh, Ghada, et al.
Pubblicazione: (2024)

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

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

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

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

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

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

Improved Lower Bound for Differentially Private Facility Location
di: Manurangsi, Pasin
Pubblicazione: (2024)

Profile Reconstruction from Private Sketches
di: Wu, Hao, et al.
Pubblicazione: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

Differential Privacy with Multiple Selections
di: Goel, Ashish, et al.
Pubblicazione: (2024)

Better Gaussian Mechanism using Correlated Noise
di: Lebeda, Christian Janos
Pubblicazione: (2024)

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