, ABW10]
Public-key cryptography from different assumptions, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.171-180, 2010. ,
DOI : 10.1145/1806689.1806715
Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks, Serge Vaudenay. Lecture Notes in Computer Science. St, vol.34, issue.1, pp.147-164, 2006. ,
DOI : 10.1109/TC.1985.1676518
URL : https://hal.archives-ouvertes.fr/hal-00337016
New Algorithms for Learning in Presence of Errors, ICALP 2011: 38th International Colloquium on Automata, Languages and Programming, pp.403-415, 2011. ,
DOI : 10.1145/1568318.1568324
Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM, Advances in Cryptology ? EUROCRYPT 2005. Ed. by Ronald Cramer, pp.128-146, 2005. ,
DOI : 10.1007/11426639_8
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity, Lecture Notes in Computer Science, vol.41, issue.2, pp.191-219, 2016. ,
DOI : 10.1016/0304-3975(85)90078-7
Algebraic attacks against random local functions and their countermeasures, 48th Annual ACM Symposium on Theory of Computing, pp.1087-1100, 2016. ,
Searching for the optimum correlation attack, Bart Preneel. Lecture Notes in Computer Science, vol.1008, pp.137-143, 1995. ,
DOI : 10.1007/3-540-60590-8_11
Practical Bootstrapping in Quasilinear Time Advances in Cryptology ? CRYPTO 2013, Part I, Lecture Notes in Computer Science. Santa ?, vol.8042, issue.159, pp.1-20, 2013. ,
Faster Bootstrapping with Polynomial Error, Lecture Notes in Computer Science, vol.8616, issue.57, pp.297-314, 2014. ,
DOI : 10.1007/978-3-662-44371-2_17
Pseudorandom generators with long stretch and low locality from random local one-way functions, 44th Annual ACM Symposium on Theory of Computing, pp.805-816, 2012. ,
Cryptographic Hardness of Random Local Functions???Survey, TCC 2013: 10th Theory of Cryptography Conference, pp.978-981, 2013. ,
DOI : 10.1007/978-3-642-36594-2_33
Abstract, Journal of Mathematical Cryptology, vol.9, issue.3 ,
DOI : 10.1515/jmc-2015-0016
Ciphers for MPC and FHE Advances in Cryptology ? EUROCRYPT 2015, Part I ,
, Lecture Notes in Computer Science, pp.430-454, 2015.
Proofs from THE BOOK (3, pp.978-981, 2004. ,
Hopes, fears, and software obfuscation, Communications of the ACM, vol.59, issue.3 ,
DOI : 10.1007/978-3-540-44993-5_2
Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256, Lecture Notes in Computer Science, vol.15, issue.2, pp.1-17, 2011. ,
DOI : 10.1007/3-540-45708-9_19
URL : https://hal.archives-ouvertes.fr/hal-00738200
A concrete security treatment of symmetric encryption, Proceedings 38th Annual Symposium on Foundations of Computer Science, pp.394-403, 1997. ,
DOI : 10.1109/SFCS.1997.646128
Diverse modules and zero-knowledge ,
url: https, 2016. ,
On the Security of IV Dependent Stream Ciphers, Alex Biryukov. Lecture Notes in Computer Science. Luxembourg, vol.4593, pp.254-273, 2007. ,
DOI : 10.1007/978-3-540-74619-5_17
(Leveled) fully homomorphic encryption without bootstrapping " . In: ITCS 2012: 3rd Innovations in Theoretical Computer Science. Ed. by Shafi Goldwasser, pp.309-325, 2012. ,
Noise-tolerant learning, the parity problem, and the statistical query model, 32nd Annual ACM Symposium on Theory of Computing, pp.435-440, 2000. ,
Optimization of Bootstrapping in Circuits, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms ,
DOI : 10.1137/1.9781611974782.160
Classical hardness of learning with errors, Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, STOC '13, pp.575-584, 2013. ,
DOI : 10.1145/2488608.2488680
URL : https://hal.archives-ouvertes.fr/hal-00922194
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits, SIAM Journal on Computing, vol.13, issue.4, pp.850-864, 1984. ,
DOI : 10.1137/0213053
On the inherent intractability of certain coding problems (Corresp.), IEEE Transactions on Information Theory, vol.24, issue.3, 1978. ,
DOI : 10.1109/TIT.1978.1055873
Pseudorandom Functions and Lattices, Lecture Notes in Computer Science, vol.7237, pp.719-737, 2012. ,
DOI : 10.1007/978-3-642-29011-4_42
Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP, Reihaneh Safavi-Naini and Ran Canetti. Lecture Notes in Computer Science, vol.7417, pp.868-886, 2012. ,
DOI : 10.1007/978-3-642-32009-5_50
Applications of Multilinear Forms to Cryptography Cryptology ePrint Archive, Report, vol.080, 2002. ,
Efficient Fully Homomorphic Encryption from (Standard) LWE, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.97-106, 2011. ,
DOI : 10.1109/FOCS.2011.12
Lattice-based FHE as secure as PKE, Proceedings of the 5th conference on Innovations in theoretical computer science, ITCS '14, pp.1-12, 2014. ,
DOI : 10.1145/2554797.2554799
Forward-Security in Private-Key Cryptography, Marc Joye. Lecture Notes in Computer Science, vol.2612, pp.1-18, 2003. ,
DOI : 10.1007/3-540-36563-X_1
Boolean Functions for Cryptography and Error-Correcting Codes Computer Science, and EngineeringEditors Hammer. Encyclopedia of Mathematics and its Applications, In: Boolean Models and Methods in Mathematics, vol.137, pp.257-397, 2010. ,
Stream Cipher, Thomas Peyrin. Lecture Notes in Computer Science, vol.9783, issue.64, pp.313-333, 2016. ,
DOI : 10.1007/0-387-23483-7_412
URL : https://hal.archives-ouvertes.fr/hal-00931697
Batch Fully Homomorphic Encryption over the Integers, Lecture Notes in Computer Science, vol.7881, pp.315-335, 2013. ,
DOI : 10.1007/978-3-642-38348-9_20
An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity, Josef Pieprzyk. Lecture Notes in Computer Science, vol.28, issue.5, pp.425-440, 2008. ,
DOI : 10.1002/j.1538-7305.1949.tb00928.x
Analysis of the algebraic side channel attack, Journal of Cryptographic Engineering, vol.24, issue.1, 2012. ,
DOI : 10.1006/jsco.1996.0125
URL : https://hal.archives-ouvertes.fr/hal-00777829
Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds Advances in Cryptology ? ASIACRYPT 2016, Part I, Lecture Notes in Computer Science, vol.10031 ,
URL : https://hal.archives-ouvertes.fr/cea-01832762
, , pp.3-33, 2016.
Improving TFHE: faster packed homomorphic operations and efficient circuit bootstrapping, In: IACR Cryptology ePrint Archive, vol.2017, p.430, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-02163307
Scale-Invariant Fully Homomorphic Encryption over the Integers, PKC 2014: 17th International Conference on Theory and Practice of Public Key Cryptography, pp.311-328, 2014. ,
DOI : 10.1007/978-3-642-54631-0_18
Algebraic Attacks on Stream Ciphers with Linear Feedback, Eli Biham. Lecture Notes in Computer Science, vol.2656, issue.119, pp.345-359, 2003. ,
DOI : 10.1007/3-540-39200-9_21
Improving the Upper Bounds on the Covering Radii of Binary Reed???Muller Codes, IEEE Transactions on Information Theory, vol.53, issue.1, pp.162-173, 2007. ,
DOI : 10.1109/TIT.2006.887494
Boolean functions with restricted input and their robustness; application to the FLIP cipher Cryptology ePrint Archive, pp.96-118 ,
0: Better Lattice Security Estimates Advances in Cryptology ? ASIACRYPT 2011, Lecture Notes in Computer Science, vol.7073, issue.57, pp.1-20, 2011. ,
Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers, Lecture Notes in Computer Science, vol.7237, pp.446-464, 2012. ,
DOI : 10.1007/978-3-642-29011-4_27
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback Advances in Cryptology ? CRYPTO 2003 Lecture Notes in Computer Science, Dan Boneh, vol.2729, issue.26, pp.176-194, 2003. ,
Higher Order Correlation Attacks, XL Algorithm and Cryptanalysis of Toyocrypt, ICISC 02: 5th International Conference on Information Security and Cryptology, pp.182-199, 2003. ,
In: LNCS, New Stream Cipher Designs -The eSTREAM Finalists 4986, pp.244-266, 2008. ,
Fully Homomophic Encryption over the Integers Revisited Advances in Cryptology ? EUROCRYPT 2015, Part I, Lecture Notes in Computer Science, vol.9056, pp.513-536, 2015. ,
Lattice Signatures and Bimodal Gaussians Advances in Cryptology ? CRYPTO 2013, Part I Lecture Notes in Computer Science, pp.40-56, 2013. ,
Higher-Order Cryptanalysis of LowMC, ICISC 15: 18th International Conference on Information Security and Cryptology, pp.87-101, 2016. ,
DOI : 10.1007/978-3-319-30840-1_6
Fully Homomorphic Encryption over the Integers, Cryptology ePrint Archive Report, vol.616616, 2009. ,
DOI : 10.1007/978-3-642-13190-5_2
Results on Algebraic Immunity for Cryptographically Significant Boolean Functions, Progress in Cryptology -INDOCRYPT 2004: 5th International Conference in Cryptology in India. Ed. by Anne Canteaut and Kapalee Viswanathan, pp.92-106, 2004. ,
DOI : 10.1007/978-3-540-30556-9_9
Spherically punctured biorthogonal codes, Proceedings of the 2012 IEEE International Symposium on Information Theory, ISIT 2012, pp.259-263, 2012. ,
Spherically Punctured Biorthogonal Codes, IEEE Transactions on Information Theory, vol.59, issue.9, pp.6010-6017, 2013. ,
DOI : 10.1109/TIT.2013.2250579
Spherically Punctured Reed-Muller Codes, IEEE Transactions on Information Theory, vol.635, issue.135, pp.2773-2780, 2017. ,
DOI : 10.1109/TIT.2017.2673827
Optimized Interpolation Attacks on LowMC, Lecture Notes in Computer Science, vol.9453, issue.74, pp.535-560, 2015. ,
DOI : 10.1007/978-3-662-48800-3_22
URL : https://hal.archives-ouvertes.fr/hal-01235171
Cryptanalysis of the FLIP Family of Stream Ciphers, Cryptology ePrint Archive ,
DOI : 10.1007/978-3-662-49890-3_13
URL : https://hal.archives-ouvertes.fr/hal-01404145
Cryptanalysis of the FLIP Family of Stream Ciphers, Lecture Notes in Computer Science, vol.9814, issue.110, pp.457-475, 2016. ,
DOI : 10.1007/978-3-662-49890-3_13
URL : https://hal.archives-ouvertes.fr/hal-01404145
FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second, Lecture Notes in Computer Science, vol.9056, issue.67, pp.617-640, 2015. ,
DOI : 10.1007/978-3-662-46800-5_24
The Design of Rijndael: AES -The Advanced Encryption Standard, pp.3-540, 2002. ,
DOI : 10.1007/978-3-662-04722-4
Cube Attacks on Tweakable Black Box Polynomials, Antoine Joux. Lecture Notes in Computer Science. Cologne, vol.49, issue.10, pp.278-299, 2009. ,
DOI : 10.1007/978-3-540-68164-9_16
Toward Practical Homomorphic Evaluation of Block Ciphers Using Prince, p.2014 ,
DOI : 10.1007/978-3-662-44774-1_17
Lecture Notes in Computer Science, pp.208-220978, 2014. ,
A new efficient algorithm for computing Groebner bases, In: Journal of Pure and Applied Algebra, vol.139, 1999. ,
Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes, Computing and Combinatorics : 22nd International Conference, COCOON 2016 Proceedings, pp.269-280978, 2016. ,
An Orthogonal Basis for Functions over a Slice of the Boolean Hypercube, Electr. J. Comb, vol.231, 2016. ,
Friedgut-Kalai-Naor Theorem for Slices of the Boolean Cube, In: Chicago J. Theor. Comput. Sci, vol.2016, 2016. ,
Invariance Principle on the Slice, 31st Conference on Computational Complexity, CCC 2016, pp.1-15, 2016. ,
DOI : 10.1109/CCC.2014.20
Algebraic Immunity of S-Boxes and Augmented Functions, Alex Biryukov. Lecture Notes in Computer Science. Luxembourg, vol.4593, pp.366-381, 2007. ,
DOI : 10.1007/978-3-540-74619-5_23
Harmonicity and Invariance on Slices of the Boolean Cube, 31st Conference on Computational Complexity, CCC 2016, pp.1-16, 2016. ,
Fully homomorphic encryption using ideal lattices, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.169-178, 2009. ,
DOI : 10.1145/1536414.1536440
Public-key cryptosystems from lattice reduction problems, Jr. Lecture Notes in Computer Science, vol.1294, pp.112-131, 1997. ,
DOI : 10.1007/BFb0052231
How to Construct Random Functions (Extended Abstract), 25th Annual Symposium on Foundations of Computer Science. Singer Island, pp.464-479, 1984. ,
Cryptographic Boolean functions with biased inputs, Cryptography and Communications 9, pp.301-314, 2017. ,
DOI : 10.1109/TIT.2012.2186785
Implementing Gentry's Fully-Homomorphic Encryption Scheme. Cryptology ePrint Archive, 2010. ,
Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.107-109, 2011. ,
DOI : 10.1109/FOCS.2011.94
Homomorphic Evaluation of the AES Circuit, Reihaneh Safavi-Naini and Ran Canetti. Lecture Notes in Computer Science, vol.7417, issue.63, pp.850-867, 2012. ,
DOI : 10.1007/978-3-642-32009-5_49
A hard-core predicate for all one-way functions, Proceedings of the twenty-first annual ACM symposium on Theory of computing , STOC '89, pp.25-32, 1989. ,
DOI : 10.1145/73007.73010
Predicate Encryption for Multi-dimensional Range Queries from Lattices, PKC 2015: 18th International Conference on, pp.752-776, 2015. ,
DOI : 10.1007/978-3-662-46447-2_34
URL : https://hal.archives-ouvertes.fr/hal-01220353
Predicting Lattice Reduction, Ed. by Nigel P. Smart. Lecture Notes in Computer Science. Istanbul, vol.4965, pp.31-51, 2008. ,
DOI : 10.1007/978-3-540-78967-3_3
Candidate One-Way Functions Based on Expander Graphs, Electronic Colloquium on Computational Complexity (ECCC), vol.49, issue.2, p.90, 2000. ,
DOI : 10.1007/BF02126799
Foundations of Cryptography: Basic Tools, p.15, 2001. ,
A Certain Class of Incidence Matrices, Proceedings of the American Mathematical Society, 1966. ,
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based, Lecture Notes in Computer Science, vol.8042, pp.75-92, 2013. ,
DOI : 10.1007/978-3-642-40041-4_5
Packing Messages and Optimizing Bootstrapping in GSW-FHE, PKC 2015: 18th International Conference on, pp.699-715, 2015. ,
DOI : 10.1007/978-3-662-46447-2_31
Algorithms in HElib, Lecture Notes in Computer Science, vol.8616, pp.554-571, 2014. ,
DOI : 10.1007/978-3-662-44371-2_31
Galois LFSR, Embedded Devices and Side Channel Weaknesses, Progress in Cryptology -INDOCRYPT 2006: 7th International Conference in Cryptology in India, pp.436-451, 2006. ,
DOI : 10.1007/11941378_31
SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers. Cryptology ePrint Archive ,
Introduction to Modern Cryptography. Chapman, Hall/Crc Cryptography, and Network Security Series, p.1584885513, 2007. ,
Conditional Differential Cryptanalysis of NLFSR-Based Cryptosystems, Ed. by Masayuki Abe. Lecture Notes in Computer Science, vol.6477, pp.130-145, 2010. ,
DOI : 10.1007/978-3-642-17373-8_8
The Art of Computer Programming, Seminumerical Algorithms. Third, vol.2, pp.71-78, 1997. ,
Integral Cryptanalysis, Lecture Notes in Computer Science, vol.2365, pp.112-127, 2002. ,
DOI : 10.1007/3-540-45661-9_9
Cryptanalyse de chiffrements symétriques. (Cryptanalysis of symmetric ciphers ,
An Improved LPN Algorithm, SCN 06: 5th International Conference on Security in Communication Networks, pp.348-359, 2006. ,
DOI : 10.1007/11832072_24
URL : https://hal.archives-ouvertes.fr/inria-00563959
Factoring polynomials with rational coefficients, Mathematische Annalen, vol.32, issue.4, pp.515-534, 1982. ,
DOI : 10.1007/BF01457454
A Comparison of the Homomorphic Encryption Schemes FV and YASHE, AFRICACRYPT 14: 7th International Conference on Cryptology in Africa, pp.318-335, 2014. ,
DOI : 10.1007/978-3-319-06734-6_20
URL : https://hal.archives-ouvertes.fr/hal-01006484
Can Homomorphic Encryption be Practical? Cryptology ePrint Archive, 2011. ,
Better Key Sizes (and Attacks) for LWE-Based Encryption, Ed. by Aggelos Kiayias. Lecture Notes in Computer Science, vol.66, issue.6, pp.319-339, 2011. ,
DOI : 10.1007/3-540-45708-9_19
On the Minimal Number of Bootstrappings in Homomorphic Circuits ,
DOI : 10.1007/978-3-642-41320-9_13
URL : https://hal.archives-ouvertes.fr/hal-00872833
Lecture Notes in Computer Science, pp.189-200, 2013. ,
On Ideal Lattices and Learning with Errors over Rings Advances in Cryptology ? EURO- CRYPT 2010, Ed. by Henri Gilbert. Lecture Notes in Computer Science. French Riviera, vol.6110, pp.1-23, 2010. ,
How to Construct Pseudorandom Permutations from Pseudorandom Functions, SIAM Journal on Computing, vol.17, issue.2, pp.15-78, 1988. ,
DOI : 10.1137/0217022
Tweakable Block Ciphers, Journal of Cryptology, vol.243, pp.588-613, 2011. ,
Worst-Case to Average-Case Reductions for Module Lattices. Cryptology ePrint Archive ,
URL : https://hal.archives-ouvertes.fr/hal-01091291
Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs. Cryptology ePrint Archive ,
A family of difference sets in non-cyclic groups, Journal of Combinatorial Theory, Series A 15, 1973. ,
Fast Correlation Attacks: Methods and Countermeasures, Antoine Joux. Lecture Notes in Computer Science. Lyngby, vol.30, issue.1, pp.55-67, 2011. ,
DOI : 10.1007/3-540-38424-3_3
On the nonlinearity of Boolean functions with restricted input. Talk at The 13th International Conference on Finite Fields and their Applications, p.134, 2017. ,
A first glimpse of cryptography's Holy Grail, Communications of the ACM, vol.53, issue.3, pp.96-96, 2010. ,
DOI : 10.1145/1666420.1666445
Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts, Lecture Notes in Computer Science, vol.9665, issue.118, pp.311-343, 2016. ,
DOI : 10.1007/978-3-662-49890-3_13
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller, Lecture Notes in Computer Science, vol.7237, pp.700-718, 2012. ,
DOI : 10.1007/978-3-642-29011-4_41
Fast Correlation Attacks on Stream Ciphers, Günther. Lecture Notes in Computer Science. Davos, vol.330, pp.301-314, 1988. ,
DOI : 10.1007/3-540-45961-8_28
Handbook of Applied Cryptography. The CRC Press series on discrete mathematics and its applications, N.W. Corporate Blvd, pp.0-8493, 1997. ,
Bootstrapping BGV Ciphertexts with a Wider Choice of $$p$$ and $$q$$, Jonathan Katz. Lecture Notes in Computer Science, vol.9020, pp.673-698, 2015. ,
DOI : 10.1007/978-3-662-46447-2_30
Algebraic Frameworks for Pseudorandom Functions url: https : / / tel . archives-ouvertes, p.1422093, 2016. ,
A Decade of Lattice Cryptography, Foundations and Trends?? in Theoretical Computer Science, vol.10, issue.4 ,
DOI : 10.1561/0400000074
Gaussian Sampling in Lattice-Based Cryptography ,
URL : https://hal.archives-ouvertes.fr/tel-01245066
url: https, 2015. ,
Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption, SAC 2015: 22nd Annual International Workshop on Selected Areas in Cryptography, pp.25-43, 2016. ,
DOI : 10.1007/978-3-642-13190-5_2
URL : https://hal.archives-ouvertes.fr/lirmm-01371764
On Data Banks and Privacy Homomorphisms, Foundations of Secure Computation, pp.169-179, 1978. ,
On lattices, learning with errors, random linear codes, and cryptography, 37th Annual ACM Symposium on Theory of Computing, pp.84-93, 2005. ,
Estimating the Security of Lattice-based Cryptosystems. Cryptology ePrint Archive, 2010. ,
Lattice basis reduction: Improved practical algorithms and solving subset sum problems, Mathematical Programming, vol.13, issue.1, pp.181-199, 1994. ,
DOI : 10.1007/BF01581144
Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.), IEEE Transactions on Information Theory, vol.30, issue.5, pp.776-780, 1984. ,
DOI : 10.1109/TIT.1984.1056949
Decrypting a Class of Stream Ciphers Using Ciphertext Only, IEEE Transactions on Computers, vol.34, issue.1, pp.81-85, 1985. ,
DOI : 10.1109/TC.1985.1676518
Leakage-Resilient Symmetric Cryptography under Empirically Verifiable Assumptions, Lecture Notes in Computer Science, vol.8042, pp.335-352, 2013. ,
DOI : 10.1007/978-3-642-40041-4_19
Efficient Public Key Encryption Based on Ideal Lattices, Cryptology ePrint Archive Report, vol.285285, 2009. ,
DOI : 10.1007/978-3-642-10366-7_36
Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes Theory and Practice of Public Key Cryptography, PKC 2010: 13th International Conference on, pp.420-443, 2010. ,
Fully Homomorphic SIMD Operations. Cryptology ePrint Archive, 2011. ,
Solving sparse linear equations over finite fields, IEEE Transactions on Information Theory, vol.32, issue.1 ,
DOI : 10.1109/TIT.1986.1057137
, IEEE Trans. Inf. Theor, vol.32, issue.1, pp.54-62, 1986.
A Diagonal Form for the Incidence Matrices of t-Subsets vs.k-Subsets, European Journal of Combinatorics, vol.11, issue.6, pp.609-615, 1990. ,
DOI : 10.1016/S0195-6698(13)80046-7
A spectral characterization of correlationimmune combining functions, IEEE Trans. Information Theory, vol.343, pp.569-571, 1988. ,