The Nonlinear Filter Model of Stream Cipher Redivivus

• URL: http://arxiv.org/abs/2502.01110v5
• Date: Tue, 29 Apr 2025 06:34:11 GMT
• Title: The Nonlinear Filter Model of Stream Cipher Redivivus
• Authors: Claude Carlet, Palash Sarkar,
• Abstract summary: The nonlinear filter model is an old and well understood approach to the design of secure stream ciphers.<n>We put forward concrete suggestions of stream ciphers which are $kappa$-bit secure against known types of attacks.<n>For the $80$-bit, $128$-bit, and the $256$-bit security levels, the circuits for the corresponding stream ciphers require about 1743.5, 2771.5, and 5607.5 NAND gates respectively.
• Score: 28.8640336189986
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: The nonlinear filter model is an old and well understood approach to the design of secure stream ciphers. Extensive research over several decades has shown how to attack stream ciphers based on this model and has identified the security properties required of the Boolean function used as the filtering function to resist such attacks. This led to the problem of constructing Boolean functions which provide adequate security \textit{and} at the same time are efficient to implement. Unfortunately, over the last two decades no good solutions to this problem appeared in the literature. The lack of good solutions has effectively led to nonlinear filter model becoming more or less obsolete. This is a big loss to the cryptographic design toolkit, since the great advantages of the nonlinear filter model are its simplicity, well understood security and the potential to provide low cost solutions for hardware oriented stream ciphers. In this paper, we revive the nonlinear filter model by constructing appropriate Boolean functions which provide required security and are also efficient to implement. We put forward concrete suggestions of stream ciphers which are $\kappa$-bit secure against known types of attacks for $\kappa=80,128,160,192,224$ and $256$. For the $80$-bit, $128$-bit, and the $256$-bit security levels, the circuits for the corresponding stream ciphers require about 1743.5, 2771.5, and 5607.5 NAND gates respectively. For the $80$-bit and the $128$-bit security levels, the gate count estimates compare quite well to the famous ciphers Trivium and Grain-128a respectively, while for the $256$-bit security level, we do not know of any other stream cipher design which has such a low gate count.

Related papers

• A Light Weight Cryptographic Solution for 6LoWPAN Protocol Stack [0.0]
  This paper presents an implementation of a lightweight 6LoWPAN Protocol stack by using a Light weight Cipher instead of regular heavy encryption cipher AES.<n>The cipher proposed in this paper is specifically suitable for 6LoWPAN architecture as it addresses all the constraints possessed by wireless sensor nodes.<n>The proposed cipher LiCi2 is motivated from LiCi cipher design but outclasses it in every design metric.
  arXiv  Detail & Related papers  (2025-10-09T23:47:04Z)
• Cryptanalysis on Lightweight Verifiable Homomorphic Encryption [7.059472280274008]
  Verifiable Homomorphic Encryption (VHE) is a cryptographic technique that integrates Homocrypt Encryption (HE) with Verifiable Computation (VC) This paper presents efficient attacks that exploit the homomorphic properties of encryption schemes.
  arXiv  Detail & Related papers  (2025-02-18T08:13:10Z)
• An Uncertainty Principle for Linear Recurrent Neural Networks [54.13281679205581]
  We build a linear filter of order $S$ that approximates the filter that looks $K$ time steps in the past. We fully characterize the problem by providing lower bounds of approximation, as well as explicit filters that achieve this lower bound up to constants. The optimal performance highlights an uncertainty principle: the filter has to average values around the $K$-th time step in the past with a range(width) that is proportional to $K/S$.
  arXiv  Detail & Related papers  (2025-02-13T13:01:46Z)
• An Attack on $p$-adic Lattice Public-key Cryptosystems and Signature Schemes [3.444630356331766]
  In this paper, we improve the LVP algorithm in local fields. We utilize this algorithm to attack the above schemes so that we are able to forge any message and decrypt any ciphertext. Although these schemes are broken, this work does not mean that $p$-adic lattices are not suitable in constructing cryptographic primitives.
  arXiv  Detail & Related papers  (2024-09-13T12:31:57Z)
• Modeling Linear and Non-linear Layers: An MILP Approach Towards Finding Differential and Impossible Differential Propagations [1.5327660568487471]
  We introduce an automatic tool for exploring differential and impossible propagations within a cipher. The tool is successfully applied to five lightweight block ciphers: Lilliput, GIFT64, SKINNY64, Klein, and M.IBS.
  arXiv  Detail & Related papers  (2024-05-01T10:48:23Z)
• Estimating the Decoding Failure Rate of Binary Regular Codes Using Iterative Decoding [84.0257274213152]
  We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder.<n>We validate our results, providing comparisons of the modeled and simulated weight of the syndrome, incorrectly-guessed error bit distribution at the end of the first iteration, and two-itcrypteration Decoding Failure Rates (DFR)
  arXiv  Detail & Related papers  (2024-01-30T11:40:24Z)
• Functional Encryption in the Bounded Storage Models [0.0]
  We investigate possibilities in the bounded quantum storage model (BQSM) and the bounded classical storage model (BCSM) In the BQSM, we construct non-interactive functional encryption satisfying information-theoretic simulation based security with $q=O(sqrts/r)$. In the BCSM, we construct non-interactive functional encryption satisfying information-theoretic subexponential simulation based security.
  arXiv  Detail & Related papers  (2023-09-13T03:55:36Z)
• Publicly-Verifiable Deletion via Target-Collapsing Functions [81.13800728941818]
  We show that targetcollapsing enables publiclyverifiable deletion (PVD) We build on this framework to obtain a variety of primitives supporting publiclyverifiable deletion from weak cryptographic assumptions.
  arXiv  Detail & Related papers  (2023-03-15T15:00:20Z)
• A Provably Secure Strong PUF based on LWE: Construction and Implementation [11.66624679713865]
  We construct a lattice PUF with provable security against ML attacks on classical and quantum computers. We prototype lattice PUF designs with $2136$ challenge-response pairs (CRPs) on a Spartan 6 FPGA. The resource-efficient design requires only $45$ slices for the PUF logic proper, and $351$ slices for a fuzzy extractor.
  arXiv  Detail & Related papers  (2023-03-05T23:41:00Z)
• An algebraic attack on stream ciphers with application to nonlinear filter generators and WG-PRNG [0.0]
  We design an attack especially effective against nonlinear filter generators. We show that the level of security of one of stream ciphers submitted to the NIST competition on Cryptography Lightweight, WG-PRNG, is less than that stated before now.
  arXiv  Detail & Related papers  (2021-12-22T23:13:45Z)
• Safe Reinforcement Learning with Linear Function Approximation [48.75026009895308]
  We introduce safety as an unknown linear cost function of states and actions, which must always fall below a certain threshold. We then present algorithms, termed SLUCB-QVI and RSLUCB-QVI, for episodic Markov decision processes (MDPs) with linear function approximation. We show that SLUCB-QVI and RSLUCB-QVI, while with emphno safety violation, achieve a $tildemathcalOleft(kappasqrtd3H3Tright)$ regret, nearly matching
  arXiv  Detail & Related papers  (2021-06-11T08:46:57Z)
• Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.