Algebra, Codes and Cryptology: First International Conference, A2C 2019 in honor of Prof. Mamadou Sanghare, Dakar, Senegal, December 5–7, 2019, Proceedings
暂无分享,去创建一个
Krishna M. Sivalingam | Alfredo Cuzzocrea | Simone Diniz Junqueira Barbosa | Xiaokang Yang | Junsong Yuan | Phoebe Chen | Xiaoyong Du | Orhun Kara | Dominik Ślęzak | Takashi Washio | Pierre-Louis Cayrel | Johannes Buchmann | Edoardo Persichetti | Ting Liu | Cheikh Thiecoumba Gueye | Mamadou Sanghare | Cheikh Anta Diop | Junsong Yuan | J. Buchmann | T. Washio | D. Ślęzak | Simone Diniz Junqueira Barbosa | Phoebe Chen | A. Cuzzocrea | Xiaoyong Du | Orhun Kara | Ting Liu | K. Sivalingam | Xiaokang Yang | Pierre-Louis Cayrel | C. T. Gueye | Edoardo Persichetti | C. A. Diop | M. Sanghare
[1] D. M. Clark. Theory of Groups , 2012 .
[2] Ayoub Otmani,et al. Square Code Attack on a Modified Sidelnikov Cryptosystem , 2015, C2SI.
[3] Enrico Thomae,et al. Decoding Random Linear Codes in Õ(20.054n) , 2012 .
[4] Joachim Rosenthal,et al. Encryption Scheme Based on Expanded Reed-Solomon Codes , 2021, Adv. Math. Commun..
[5] Viktor T. Markov,et al. Group codes of dimension 2 and 3 are abelian , 2019, Finite Fields Their Appl..
[6] Jean-Charles Faugère,et al. Algebraic Cryptanalysis of McEliece Variants with Compact Keys , 2010, EUROCRYPT.
[7] R. Brualdi,et al. Handbook Of Coding Theory , 2011 .
[8] D. Passman,et al. The algebraic structure of group rings , 1977 .
[9] Alexandr Nechaev,et al. New examples of non-abelian group codes , 2016, Adv. Math. Commun..
[10] Ernst M. Gabidulin,et al. Ideals over a Non-Commutative Ring and thier Applications in Cryptology , 1991, EUROCRYPT.
[11] V. Sidelnikov,et al. A public-key cryptosystem based on binary Reed-Muller codes , 1994 .
[12] Nicolas Sendrier,et al. Analysis of Information Set Decoding for a Sub-linear Error Weight , 2016, PQCrypto.
[13] Alexander Nilsson,et al. Error Amplification in Code-based Cryptography , 2018, IACR Trans. Cryptogr. Hardw. Embed. Syst..
[14] Yongge Wang,et al. Quantum resistant random linear code based public key encryption scheme RLCE , 2015, 2016 IEEE International Symposium on Information Theory (ISIT).
[15] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..
[16] Moti Yung,et al. Malicious cryptography - exposing cryptovirology , 2004 .
[17] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[18] S. González,et al. GROUP CODES OVER NON-ABELIAN GROUPS , 2013 .
[19] Paulo S. L. M. Barreto,et al. Compact McEliece Keys from Goppa Codes , 2009, IACR Cryptol. ePrint Arch..
[20] Robert J. McEliece,et al. A public key cryptosystem based on algebraic coding theory , 1978 .
[21] A. Nechaev,et al. Kerdock code in a cyclic form , 1989 .
[22] Jean-Charles Faugère,et al. Structural cryptanalysis of McEliece schemes with compact keys , 2016, Des. Codes Cryptogr..
[23] José Joaquín Bernal,et al. An intrinsical description of group codes , 2009, Des. Codes Cryptogr..
[24] Matthieu Finiasz,et al. Security Bounds for the Design of Code-Based Cryptosystems , 2009, ASIACRYPT.
[25] Moti Yung,et al. The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems , 1997, CRYPTO.
[26] V. Sidelnikov,et al. On insecurity of cryptosystems based on generalized Reed-Solomon codes , 1992 .
[27] N. J. A. Sloane,et al. The Z4-linearity of Kerdock, Preparata, Goethals, and related codes , 1994, IEEE Trans. Inf. Theory.
[28] Nicolas Sendrier,et al. Finding the permutation between equivalent linear codes: The support splitting algorithm , 2000, IEEE Trans. Inf. Theory.
[29] V. T. Markov,et al. Non-Abelian Group Codes over an Arbitrary Finite Field , 2017 .
[30] Edoardo Persichetti. On the CCA2 Security of McEliece in the Standard Model , 2018, ProvSec.
[31] Robert J. McEliece,et al. Subspace subcodes of Reed-Solomon codes , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.
[32] Jacques Stern,et al. A method for finding codewords of small weight , 1989, Coding Theory and Applications.
[33] Christiane Peters,et al. Information-Set Decoding for Linear Codes over Fq , 2010, PQCrypto.
[34] Alexander May,et al. On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes , 2015, EUROCRYPT.
[35] Nicolas Sendrier. QC-MDPC-McEliece: A public-key code-based encryption scheme based on quasi-cyclic moderate density parity check codes , 2014 .
[36] Christian Wieschebrink,et al. Two NP-complete Problems in Coding Theory with an Application in Code Based Cryptography , 2006, 2006 IEEE International Symposium on Information Theory.
[37] Pierre Loidreau,et al. A New Rank Metric Codes Based Encryption Scheme , 2017, PQCrypto.
[38] Peter W. Shor,et al. Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[39] Eugene Prange,et al. The use of information sets in decoding cyclic codes , 1962, IRE Trans. Inf. Theory.
[40] Young-Sik Kim,et al. New McEliece cryptosystem based on polar codes as a candidate for post-quantum cryptography , 2014, 2014 14th International Symposium on Communications and Information Technologies (ISCIT).