Affine-evasive sets modulo a prime

DOI10.1016/J.IPL.2014.10.015MaRDI QIDQ477696zbMATH OpenOpenAlexFDO

Authors 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

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)

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

Cites work

• Capacity of non-malleable codes
• Continuous non-malleable codes
• Non-malleable codes
• Non-malleable codes from additive combinatorics (extended abstract)
• Non-malleable codes from two-source extractors
• Tamper and Leakage Resilience in the Split-State Model
• The number of primes in a short interval.

Cited in

(5)

• 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
• A note on subspace evasive sets

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)