Affine-evasive sets modulo a prime

DOI10.1016/j.ipl.2014.10.015zbMath1320.94110OpenAlexW1996716779MaRDI QIDQ477696

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

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

Related Items (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

Cites Work

• Non-malleable coding against bit-wise and split-state tampering
• 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 Codes
• Non-malleable codes from additive combinatorics
• Continuous Non-malleable Codes

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