Balanced non-adjacent forms
From MaRDI portal
Publication:6157562
DOI10.1007/978-3-030-92078-4_19zbMath1514.94107OpenAlexW3203145551MaRDI QIDQ6157562
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92078-4_19
implementationfully homomorphic encryptionnoise controlinteger recodinglattice cryptographygadget decomposition
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Primality (11Y11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- New left-to-right minimal weight signed-digit radix-\(r\) representation
- Efficient arithmetic on Koblitz curves
- TFHE: fast fully homomorphic encryption over the torus
- Worst-case to average-case reductions for module lattices
- Homomorphic encryption for arithmetic of approximate numbers
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Faster Bootstrapping with Polynomial Error
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully Homomophic Encryption over the Integers Revisited
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Optimal left-to-right binary signed-digit recoding
- Computing arbitrary functions of encrypted data
- Digit Set Randomization in Elliptic Curve Cryptography
- Efficient Public Key Encryption Based on Ideal Lattices
- A Survey of Fast Exponentiation Methods
- Discrete Weighted Transforms and Large-Integer Arithmetic
- Homomorphic Encryption
- On arithmetic weight for a general radix representation of integers (Corresp.)
- Speeding up the computations on an elliptic curve using addition-subtraction chains
- On Ideal Lattices and Learning with Errors over Rings
- Information Security
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Classical hardness of learning with errors
- Minimality and other properties of the width-𝑤 nonadjacent form
- Selected Areas in Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Balanced non-adjacent forms
