Výsledky vyhledávání - "ACM: E.: Data/E.4: CODING AND INFORMATION THEORY"

Synchronization Recovery and State Model Reduction for Soft Decoding of Variable Length Codes

Autoři: Malinowski, Simon Jégou, Hervé Guillemot, Christine a další

Přispěvatelé: Malinowski, Simon Jégou, Hervé Guillemot, Christine a další

Zdroj: IEEE Transactions on Information Theory. 53:368-377

Témata: Networking and Internet Architecture (cs.NI), FOS: Computer and information sciences, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, joint source/channel coding, Computer Science - Information Theory, Information Theory (cs.IT), 05 social sciences, [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], 02 engineering and technology, variable length codes, Computer Science - Networking and Internet Architecture, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], 0508 media and communications, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], data compression

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/pdf/cs/0612059
http://arxiv.org/abs/cs/0612059
https://inria.hal.science/inria-00119600v2/document
https://inria.hal.science/inria-00119600v2
https://doi.org/10.1109/tit.2006.887512
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004039667
https://hal.inria.fr/inria-00119600v2
https://www.infona.pl/resource/bwmeta1.element.ieee-art-000004039667
https://hal.inria.fr/inria-00119600/document
https://dblp.uni-trier.de/db/journals/corr/corr0612.html#abs-cs-0612059
http://dblp.uni-trier.de/db/journals/corr/corr0612.html#abs-cs-0612059

The dimension of ergodic random sequences

Autoři: Hoyrup, Mathieu Theoretical adverse computations, and safety (CARTE) Centre Inria de l'Université de Lorraine a další

Přispěvatelé: Hoyrup, Mathieu Theoretical adverse computations, and safety (CARTE) Centre Inria de l'Université de Lorraine a další

Zdroj: STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) ; https://inria.hal.science/inria-00606457 ; STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.567-576

Témata: Shannon-McMillan-Breiman theorem, Martin-Löf random sequence, effective Hausdorff dimension, compression rate, entropy, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.0: Computability theory, ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]

Geografické téma: Paris, France

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1107.1149; ARXIV: 1107.1149

Dostupnost: https://inria.hal.science/inria-00606457
https://inria.hal.science/inria-00606457v4/document
https://inria.hal.science/inria-00606457v4/file/paperbiblio.pdf

Permutation decoding: Towards an approach using algebraic properties of the -subcode

Autoři: Legeay, Matthieu Institut de Recherche Mathématique de Rennes (IRMAR) Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes) a další

Přispěvatelé: Legeay, Matthieu Institut de Recherche Mathématique de Rennes (IRMAR) Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes) a další

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://inria.hal.science/inria-00608107 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.193-202

Témata: permutation group, subcode, idempotent subcode, de- coding, Goppa code, quasi-cyclic code, ACM: E.: Data/E.3: DATA ENCRYPTION, ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]

Geografické téma: Paris, France

Dostupnost: https://inria.hal.science/inria-00608107
https://inria.hal.science/inria-00608107v1/document
https://inria.hal.science/inria-00608107v1/file/22.pdf

Scheduled-PEG construction of LDPC codes for Upper-Layer FEC

Autoři: Pham Sy, Lam Savin, Valentin Declercq, David a další

Přispěvatelé: Pham Sy, Lam Savin, Valentin Declercq, David a další

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://inria.hal.science/inria-00614468 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.429-432

Témata: LDPC codes, bipartite graph, PEG, UL-FEC, decoding overhead/inefficiency, ACM: E.: Data/E.3: DATA ENCRYPTION, ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]

Geografické téma: Paris, France

Dostupnost: https://inria.hal.science/inria-00614468
https://inria.hal.science/inria-00614468v1/document
https://inria.hal.science/inria-00614468v1/file/65.pdf

Factorisation in M'(Fq)[X]. Construction of quasi-cyclic codes

Autoři: Chabot, Christophe Calculs Algébriques et Systèmes Dynamiques (CASYS) Laboratoire Jean Kuntzmann (LJK) a další

Přispěvatelé: Chabot, Christophe Calculs Algébriques et Systèmes Dynamiques (CASYS) Laboratoire Jean Kuntzmann (LJK) a další

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://inria.hal.science/inria-00611781 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.209-218

Témata: Quasi-cyclic codes, factorisation, non-integral ring, olynomials with matricial coefficients, ACM: E.: Data/E.3: DATA ENCRYPTION, ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]

Geografické téma: Paris, France

Dostupnost: https://inria.hal.science/inria-00611781
https://inria.hal.science/inria-00611781v1/document
https://inria.hal.science/inria-00611781v1/file/122.pdf

List-Decoding of Binary Goppa Codes up to the Binary Johnson Bound

Autoři: Augot, Daniel Barbier, Morgan Couvreur, Alain a další

Přispěvatelé: Augot, Daniel Barbier, Morgan Couvreur, Alain a další

Zdroj: IEEE Information Theory Workshop ; https://inria.hal.science/hal-00643794 ; IEEE Information Theory Workshop, Oct 2011, Paraty, Brazil. pp.229 - 233, ⟨10.1109/ITW.2011.6089384⟩

Témata: ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]

Geografické téma: Paraty, Brazil

Dostupnost: https://inria.hal.science/hal-00643794
https://inria.hal.science/hal-00643794v1/document
https://inria.hal.science/hal-00643794v1/file/augot_barbier_couvreur_itw.pdf
https://doi.org/10.1109/ITW.2011.6089384

On the Parameters of Codes with Two Homogeneous Weights

Autoři: Byrne, Eimear Sneyd, Alison School of Mathematical Sciences, University College Dublin a další

Přispěvatelé: Byrne, Eimear Sneyd, Alison School of Mathematical Sciences, University College Dublin a další

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://inria.hal.science/inria-00607341 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.81-90

Témata: ACM: E.: Data/E.3: DATA ENCRYPTION, ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]

Geografické téma: Paris, France

Relation: inria-00607341; https://inria.hal.science/inria-00607341; https://inria.hal.science/inria-00607341/document; https://inria.hal.science/inria-00607341/file/133.pdf

Dostupnost: https://inria.hal.science/inria-00607341
https://inria.hal.science/inria-00607341/document
https://inria.hal.science/inria-00607341/file/133.pdf

Constructive Spherical Codes near the Shannon Bound

Autoři: Solé, Patrick Belfiore, Jean-Claude Télécom ParisTech

Přispěvatelé: Solé, Patrick Belfiore, Jean-Claude Télécom ParisTech

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://inria.hal.science/inria-00614479 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.453-462

Témata: spherical codes, codes for the Euclidean metric, saddle point method, ACM: E.: Data/E.3: DATA ENCRYPTION, ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]

Geografické téma: Paris, France

Relation: inria-00614479; https://inria.hal.science/inria-00614479; https://inria.hal.science/inria-00614479/document; https://inria.hal.science/inria-00614479/file/10.pdf

Dostupnost: https://inria.hal.science/inria-00614479
https://inria.hal.science/inria-00614479/document
https://inria.hal.science/inria-00614479/file/10.pdf

A Complete Characterization of Irreducible Cyclic Orbit Codes

Autoři: Trautmann, Anna-Lena Rosenthal, Joachim Universität Zürich Zürich = University of Zurich (UZH)

Přispěvatelé: Trautmann, Anna-Lena Rosenthal, Joachim Universität Zürich Zürich = University of Zurich (UZH)

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://inria.hal.science/inria-00611789 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.219-228

Témata: ACM: E.: Data/E.3: DATA ENCRYPTION, ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]

Geografické téma: Paris, France

Relation: inria-00611789; https://inria.hal.science/inria-00611789; https://inria.hal.science/inria-00611789/document; https://inria.hal.science/inria-00611789/file/83.pdf

Dostupnost: https://inria.hal.science/inria-00611789
https://inria.hal.science/inria-00611789/document
https://inria.hal.science/inria-00611789/file/83.pdf

The Dual Code of Points and t-Spaces in the Projective Space

Autoři: De Boeck, Maarten Department of Mathematics Gent/Ghent Universiteit Gent = Ghent University Belgium (UGENT)

Přispěvatelé: De Boeck, Maarten Department of Mathematics Gent/Ghent Universiteit Gent = Ghent University Belgium (UGENT)

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00607291 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.57-62

Témata: Linear codes, Projective spaces, Small weight codewords, ACM: E.: Data/E.3: DATA ENCRYPTION, ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]

Geografické téma: Paris, France

Relation: inria-00607291; https://hal.inria.fr/inria-00607291; https://hal.inria.fr/inria-00607291/document; https://hal.inria.fr/inria-00607291/file/53.pdf

Dostupnost: https://hal.inria.fr/inria-00607291
https://hal.inria.fr/inria-00607291/document
https://hal.inria.fr/inria-00607291/file/53.pdf

A variant of the McEliece cryptosystem with increased public key security

Autoři: Baldi, Marco Bianchi, Marco Chiaraluce, Franco a další

Přispěvatelé: Baldi, Marco Bianchi, Marco Chiaraluce, Franco a další

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00607772 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.173-182

Témata: public key security, McEliece cryptosystem, error-correcting codes, ACM: E.: Data/E.3: DATA ENCRYPTION, ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]

Geografické téma: Paris, France

Relation: inria-00607772; https://hal.inria.fr/inria-00607772; https://hal.inria.fr/inria-00607772/document; https://hal.inria.fr/inria-00607772/file/69.pdf

Dostupnost: https://hal.inria.fr/inria-00607772
https://hal.inria.fr/inria-00607772/document
https://hal.inria.fr/inria-00607772/file/69.pdf

LDPC codes arising from partial and semipartial geometries

Autoři: Vandendriessche, Peter Department of Mathematics Universiteit Gent = Ghent University Belgium (UGENT)

Přispěvatelé: Vandendriessche, Peter Department of Mathematics Universiteit Gent = Ghent University Belgium (UGENT)

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00614462 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.419-428

Témata: LDPC codes, bounds, fi nite geometry codes, minimum distance, partial and semipartial geometries, ACM: E.: Data/E.3: DATA ENCRYPTION, ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]

Geografické téma: Paris, France

Relation: inria-00614462; https://hal.inria.fr/inria-00614462; https://hal.inria.fr/inria-00614462/document; https://hal.inria.fr/inria-00614462/file/61.pdf

Dostupnost: https://hal.inria.fr/inria-00614462
https://hal.inria.fr/inria-00614462/document
https://hal.inria.fr/inria-00614462/file/61.pdf

A Lower Bound for the Nonlinearity of Exponential Welch Costas Functions

Autoři: Hakala, Risto Department of Information and Computer Science Aalto University

Přispěvatelé: Hakala, Risto Department of Information and Computer Science Aalto University

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00614457 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.397-404

Témata: Nonlinearity, Welch Costas functions, exponential function, Fourier transform, ACM: E.: Data/E.3: DATA ENCRYPTION, ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]

Geografické téma: Paris, France

Relation: inria-00614457; https://hal.inria.fr/inria-00614457; https://hal.inria.fr/inria-00614457/document; https://hal.inria.fr/inria-00614457/file/52.pdf

Dostupnost: https://hal.inria.fr/inria-00614457
https://hal.inria.fr/inria-00614457/document
https://hal.inria.fr/inria-00614457/file/52.pdf

On CCZ-equivalence of Addition mod 2n

Autoři: Schulte-Geers, Ernst Bundesamt für Sicherheit in der Informationstechnik = Office fédéral de la sécurité des technologies de l’information = Federal Office for Information Security (BSI)

Přispěvatelé: Schulte-Geers, Ernst Bundesamt für Sicherheit in der Informationstechnik = Office fédéral de la sécurité des technologies de l’information = Federal Office for Information Security (BSI)

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00607747 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.131-142

Témata: CCZ-equivalence, addition, Walsh transform, di erential eq. of addition, ACM: E.: Data/E.3: DATA ENCRYPTION, ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]

Geografické téma: Paris, France

Relation: inria-00607747; https://hal.inria.fr/inria-00607747; https://hal.inria.fr/inria-00607747/document; https://hal.inria.fr/inria-00607747/file/113.pdf

Dostupnost: https://hal.inria.fr/inria-00607747
https://hal.inria.fr/inria-00607747/document
https://hal.inria.fr/inria-00607747/file/113.pdf

Algebraic Decoding of Negacyclic Codes over Z4

Autoři: Byrne, Eimear Greferath, Marcus Zumbragel, Jens a další

Přispěvatelé: Byrne, Eimear Greferath, Marcus Zumbragel, Jens a další

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00607733 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.101-110

Témata: module of solutions, negacyclic code, integers modulo 4, Lee metric, Galois Ring, decoding, Grobner bases, key equation, solution by approximations, ACM: E.: Data/E.3: DATA ENCRYPTION, ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]

Geografické téma: Paris, France

Relation: inria-00607733; https://hal.inria.fr/inria-00607733; https://hal.inria.fr/inria-00607733/document; https://hal.inria.fr/inria-00607733/file/66.pdf

Dostupnost: https://hal.inria.fr/inria-00607733
https://hal.inria.fr/inria-00607733/document
https://hal.inria.fr/inria-00607733/file/66.pdf

Optimality of a 2-identifying code in the hexagonal grid

Autoři: Ville, Junnila Laihonen, Tero Turku Centre for Computer Science a další

Přispěvatelé: Ville, Junnila Laihonen, Tero Turku Centre for Computer Science a další

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00607289 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.47-56

Témata: Identifying code, optimal code, hexagonal grid, ACM: E.: Data/E.3: DATA ENCRYPTION, ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]

Geografické téma: Paris, France

Relation: inria-00607289; https://hal.inria.fr/inria-00607289; https://hal.inria.fr/inria-00607289/document; https://hal.inria.fr/inria-00607289/file/45.pdf

Dostupnost: https://hal.inria.fr/inria-00607289
https://hal.inria.fr/inria-00607289/document
https://hal.inria.fr/inria-00607289/file/45.pdf

Optimal Arcs in Hjelmslev Spaces of Large Dimension

Autoři: Boev, Stoyan Honold, Thomas Landjev, Ivan a další

Přispěvatelé: Boev, Stoyan Honold, Thomas Landjev, Ivan a další

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00607294 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.63-70

Témata: projective Hjelmslev geometry, projective Hjelmslev plane, arcs, optimal arcs, finite chain ring Subject Classifications:51E26, 51E21, 51E22, 94B05, ACM: E.: Data/E.3: DATA ENCRYPTION, ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]

Geografické téma: Paris, France

Relation: inria-00607294; https://hal.inria.fr/inria-00607294; https://hal.inria.fr/inria-00607294/document; https://hal.inria.fr/inria-00607294/file/67.pdf

Dostupnost: https://hal.inria.fr/inria-00607294
https://hal.inria.fr/inria-00607294/document
https://hal.inria.fr/inria-00607294/file/67.pdf

On the Number of Distinct Legendre, Jacobi,Hessian and Edwards Curves (Extended Abstract)

Autoři: Farashahi, Reza Rezaeian Department of computing (Department of computing) Macquarie University

Přispěvatelé: Farashahi, Reza Rezaeian Department of computing (Department of computing) Macquarie University

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00607279 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.37-46

Témata: Elliptic curve, Legendre curve, Jacobi curve, Hessian curve, Edwards curve, j-invariant, isomorphism, cryptography, ACM: E.: Data/E.3: DATA ENCRYPTION, ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]

Geografické téma: Paris, France

Relation: inria-00607279; https://hal.inria.fr/inria-00607279; https://hal.inria.fr/inria-00607279/document; https://hal.inria.fr/inria-00607279/file/76.pdf

Dostupnost: https://hal.inria.fr/inria-00607279
https://hal.inria.fr/inria-00607279/document
https://hal.inria.fr/inria-00607279/file/76.pdf

Cryptanalysis of Dual CRT-RSA

Autoři: Santanu, Sarkar Maitra, Subhamoy Indian Statistical Institute Kolkata

Přispěvatelé: Santanu, Sarkar Maitra, Subhamoy Indian Statistical Institute Kolkata

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00607276 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.27-36

Témata: RSA, CRT-RSA, Dual CRT-RSA, Cryptanalysis, Lattices, ACM: E.: Data/E.3: DATA ENCRYPTION, ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]

Geografické téma: Paris, France

Relation: inria-00607276; https://hal.inria.fr/inria-00607276; https://hal.inria.fr/inria-00607276/document; https://hal.inria.fr/inria-00607276/file/12.pdf

Dostupnost: https://hal.inria.fr/inria-00607276
https://hal.inria.fr/inria-00607276/document
https://hal.inria.fr/inria-00607276/file/12.pdf

Reconstruction and Error Correction of RSA Secret Parameters from the MSB Side

Autoři: Santanu, Sarkar Sourav Sen, Gupta Subhamoy, Maitra a další

Přispěvatelé: Santanu, Sarkar Sourav Sen, Gupta Subhamoy, Maitra a další

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00607242 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.7-16

Témata: RSA, Error correction, Prime reconstruction, Random known bits, ACM: E.: Data/E.3: DATA ENCRYPTION, ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]

Geografické téma: Paris, France

Relation: inria-00607242; https://hal.inria.fr/inria-00607242; https://hal.inria.fr/inria-00607242/document; https://hal.inria.fr/inria-00607242/file/90.pdf

Dostupnost: https://hal.inria.fr/inria-00607242
https://hal.inria.fr/inria-00607242/document
https://hal.inria.fr/inria-00607242/file/90.pdf