Towards efficient LPN-based symmetric encryption
A promising approach in cryptography is to construct encryption schemes based on the learning parity with noise (LPN) problem as these schemes can typically be implemented fairly efficiently using mainly ``exclusive or (XOR) operations. Most constructed LPN-based schemes are asymmetric, and there is no practical evaluation of any LPN-based symmetric encryption scheme. In this paper, the authors propose a novel LPN-based symmetric encryption scheme that is more efficient than related schemes. They propose a synchronous stream cipher, called Firekite, which uses an LPN-based pseudo-random number generator (PRNG) with a simple structure to generate its keystream. Unlike other proposed encryption schemes based on the LPN problem, this scheme only requires a source of cryptographically strong random bits for a key generation but not for encryption. Moreover, as their scheme can greatly benefit from dedicated hardware, the authors implemented and evaluated it on a low-power field-programmable gate array (FPGA). To the best of our knowledge, this is also the first time any LPN-based encryption scheme is tested and evaluated on an FPGA. For the entire collection see [Zbl 1482.94011].
- : Increasing the Security and Efficiency of
- An Improved LPN Algorithm
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Authenticating Pervasive Devices with Human Protocols
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- Efficient Authentication from Hard Learning Problems
- Extractors and pseudorandom generators
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Faster algorithms for solving LPN
- HELEN: a public-key cryptosystem based on the LPN and the decisional minimal distance problems
- How to Encrypt with the LPN Problem
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 5081837 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 2081058 (Why is no real title available?)
- IND-CCA secure cryptography based on a variant of the LPN problem
- Lapin: an efficient authentication protocol based on ring-LPN
- Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification
- Man-in-the-middle secure authentication schemes from LPN and weak PRFs
- Noise-tolerant learning, the parity problem, and the statistical query model
- Optimization of \(\mathsf {LPN}\) solving algorithms
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Pseudorandom functions in almost constant depth from low-noise LPN
- Simple chosen-ciphertext security from low-noise LPN
- Solving LPN Using Covering Codes
- Two-round man-in-the-middle security from LPN
This page was built for publication: Towards efficient LPN-based symmetric encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117050)
