Balanced non-adjacent forms

DOI10.1007/978-3-030-92078-4_19MaRDI QIDQ6157562zbMATH OpenOpenAlexFDO

Authors Marc Joye

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

zbMATH Keywords

fully homomorphic encryptiongadget decompositionimplementationinteger recodinglattice cryptographynoise control

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Primality (11Y11) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Publication:4892191
• Balanced spaces of forms and skew cyclic transformations
• Balanced forms: Canonicity and parameterization
• scientific article; zbMATH DE number 5353930
• scientific article; zbMATH DE number 3456979
• Symmetric non-negative forms and sums of squares
• Balanced simplices
• Admissible balanced pairs over formal triangular matrix rings
• Approximately symmetric forms far from being exactly symmetric
• Balanced equi-n-squares

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A Survey of Fast Exponentiation Methods
• Classical hardness of learning with errors
• Computer arithmetic algorithms.
• Computing arbitrary functions of encrypted data
• Digit Set Randomization in Elliptic Curve Cryptography
• Discrete Weighted Transforms and Large-Integer Arithmetic
• Efficient arithmetic on Koblitz curves
• Efficient fully homomorphic encryption from (standard) LWE
• Efficient public key encryption based on ideal lattices (extended abstract)
• Faster Bootstrapping with Polynomial Error
• FHEW: bootstrapping homomorphic encryption in less than a second
• Fully homomophic encryption over the integers revisited
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
• Homomorphic encryption
• Homomorphic encryption for arithmetic of approximate numbers
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• scientific article; zbMATH DE number 2085444 (Why is no real title available?)
• scientific article; zbMATH DE number 176613 (Why is no real title available?)
• scientific article; zbMATH DE number 1250549 (Why is no real title available?)
• scientific article; zbMATH DE number 708816 (Why is no real title available?)
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• Information Security
• Minimality and other properties of the width-𝑤 nonadjacent form
• New left-to-right minimal weight signed-digit radix-\(r\) representation
• On arithmetic weight for a general radix representation of integers (Corresp.)
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• Optimal left-to-right binary signed-digit recoding
• Selected Areas in Cryptography
• Speeding up the computations on an elliptic curve using addition-subtraction chains
• TFHE: fast fully homomorphic encryption over the torus
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Worst-case to average-case reductions for module lattices

Cited in

(1)

• Forms of Lepage type and the balance systems

This page was built for publication: Balanced non-adjacent forms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157562)