Affine-evasive sets modulo a prime
type: Item
instance of: scholarly article
title: Affine-evasive sets modulo a prime
zbMATH Open document ID: 1320.94110
author: Divesh Aggarwal
published in: Information Processing Letters
publication date: 2014-12-09T00:00:00Z
Mathematics Subject Classification ID: 94B40
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6378690
zbMATH Keywords: cryptography
zbMATH Keywords: non-malleable codes
zbMATH Keywords: coding theory
zbMATH Keywords: tamper-resilient cryptography
MaRDI profile type: Publication
full work available at URL: j.ipl.2014.10.015
OpenAlex ID: W1996716779
cites work: Non-malleable codes from additive combinatorics
cites work: Capacity of non-malleable codes
cites work: Non-malleable coding against bit-wise and split-state tampering
cites work: Non-malleable Codes from Two-Source Extractors
cites work: Non-Malleable Codes
cites work: Continuous Non-malleable Codes
cites work: The number of primes in a short interval.
cites work: Tamper and Leakage Resilience in the Split-State Model
DOI: 10.1016/J.IPL.2014.10.015
Recommended article: On primitive elements of finite fields avoiding affine hyperplanes
Recommended article: Affine extractors over prime fields
Recommended article: Set systems with restricted intersections modulo prime powers
Recommended article: On Relatively Prime Sets
Recommended article: Set systems with \(\mathcal L\)-intersections modulo a prime number
Recommended article: A generalization of sumsets modulo a prime
Recommended article: \(G\)-sets and linear recurrences modulo primes
Recommended article: Q3415028
Recommended article: Q5173199
Recommended article: Optimal primitive sets with restricted primes
description: scientific article; zbMATH DE number 6378690