Affine-evasive sets modulo a prime

DOI10.1016/J.IPL.2014.10.015zbMATH Open1320.94110OpenAlexW1996716779MaRDI QIDQ477696FDOQ477696

Divesh Aggarwal

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.10.015

Recommendations

• On primitive elements of finite fields avoiding affine hyperplanes
• Affine extractors over prime fields
• Set systems with restricted intersections modulo prime powers
• On Relatively Prime Sets
• Set systems with \(\mathcal L\)-intersections modulo a prime number
• A generalization of sumsets modulo a prime
• \(G\)-sets and linear recurrences modulo primes
• Affine invariants, relatively prime sets, and a phi function for subsets of \(\{1, 2,\dots, n\}\)
• A note on subspace evasive sets
• Optimal primitive sets with restricted primes

zbMATH Keywords

cryptographycoding theorynon-malleable codestamper-resilient cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Arithmetic codes (94B40)

Cites Work

• Non-Malleable Codes
• Non-malleable Codes from Two-Source Extractors
• Tamper and Leakage Resilience in the Split-State Model
• Capacity of non-malleable codes
• The number of primes in a short interval.
• Non-malleable coding against bit-wise and split-state tampering
• Non-malleable codes from additive combinatorics
• Continuous Non-malleable Codes

Cited In (4)

• Continuously non-malleable codes in the split-state model
• Nonmalleable Extractors and Codes, with Their Many Tampered Extensions
• Non-Malleable Codes from Additive Combinatorics
• Optimal Computational Split-state Non-malleable Codes

This page was built for publication: Affine-evasive sets modulo a prime

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477696)