Výsledky vyhľadávania - ACM: E.: Data/E.4: CODING AND INFORMATION THEORY*

Multicomponent Network Coding

Autori: Gabidulin, Ernst M. Pilipchuk, Nina Moscow Institute of Physics and Technology Moscow (MIPT)

Prispievatelia: Gabidulin, Ernst M. Pilipchuk, Nina Moscow Institute of Physics and Technology Moscow (MIPT)

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00614477 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.443-452

Predmety: Network coding, subspace distance, rank-metric codes, decoding, 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-00614477; https://hal.inria.fr/inria-00614477; https://hal.inria.fr/inria-00614477/document; https://hal.inria.fr/inria-00614477/file/29.pdf

Dostupnosť: https://hal.inria.fr/inria-00614477
https://hal.inria.fr/inria-00614477/document
https://hal.inria.fr/inria-00614477/file/29.pdf

Low-rate coding using incremental redundancy for GLDPC codes

Autori: Cunche, Mathieu Savin, Valentin Roca, Vincent a ďalší

Prispievatelia: Cunche, Mathieu Savin, Valentin Roca, Vincent a ďalší

Zdroj: IEEE International Workshop on Satellite and Space Communications 2008 (IWSSC'08) ; https://inria.hal.science/inria-00305684 ; IEEE International Workshop on Satellite and Space Communications 2008 (IWSSC'08), Oct 2008, Toulouse, France

Predmety: ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, ACM: E.: Data/E.4: CODING AND INFORMATION THEORY/E.4.1: Error control codes, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]

Geografické téma: Toulouse, France

Dostupnosť: https://inria.hal.science/inria-00305684
https://inria.hal.science/inria-00305684v1/document
https://inria.hal.science/inria-00305684v1/file/iwssc08_small_rate_gldpc.pdf

An Interpolation Procedure for List Decoding Reed–Solomon Codes Based on Generalized Key Equations

Autori: Zeh, Alexander Gentner, Christian Augot, Daniel a ďalší

Prispievatelia: Zeh, Alexander Gentner, Christian Augot, Daniel a ďalší

Zdroj: IEEE Transactions on Information Theory. 57:5946-5959

Predmety: FOS: Computer and information sciences, fundamental iterative algorithm (FIA), Computer Science - Information Theory, Information Theory (cs.IT), [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], Guruswami–Sudan interpolation, key equation, 0102 computer and information sciences, 02 engineering and technology, Reed–Solomon codes, 01 natural sciences, [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], ACM: E.: Data/E.4: CODING AND INFORMATION THEORY/E.4.1: Error control codes, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], Block-Hankel matrix, 0202 electrical engineering, electronic engineering, information engineering, Nachrichtensysteme, [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], list decoding

Popis súboru: application/pdf

Prístupová URL adresa: https://elib.dlr.de/72163/1/10.1.1.220.6721%281%29.pdf
http://arxiv.org/abs/1110.3898
https://inria.hal.science/inria-00633205v1
https://inria.hal.science/inria-00633205v1/document
https://doi.org/10.1109/tit.2011.2162160
https://arxiv.org/abs/1110.3898
https://arxiv.org/abs/1110.3898
https://hal.inria.fr/inria-00633205/document
https://hal.inria.fr/inria-00633205
http://dblp.uni-trier.de/db/journals/corr/corr1110.html#abs-1110-3898
https://www.arxiv-vanity.com/papers/1110.3898/
https://ieeexplore.ieee.org/document/6006633/
https://elib.dlr.de/72163/
https://doi.org/10.1109/tit.2011.2162160
https://elib.dlr.de/72163/

Wet paper codes and the dual distance in steganography

Autori: Munuera, Carlos Barbier, Morgan Universidad de Valladolid Valladolid (UVa) a ďalší

Prispievatelia: Munuera, Carlos Barbier, Morgan Universidad de Valladolid Valladolid (UVa) a ďalší

Zdroj: Advances in Mathematics of Communications. 6:273-285

Predmety: FOS: Computer and information sciences, Computer Science - Cryptography and Security, Computer Science - Information Theory, Information Theory (cs.IT), [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.3: Applications, dual distance, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], ACM: E.: Data/E.4: CODING AND INFORMATION THEORY/E.4.1: Error control codes, [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], Steganography, wet paper codes, Error-correcting codes, Cryptography and Security (cs.CR), [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/1104.1970

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

Autori: Malinowski, Simon Jégou, Hervé Guillemot, Christine a ďalší

Prispievatelia: Malinowski, Simon Jégou, Hervé Guillemot, Christine a ďalší

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

Predmety: 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 súboru: application/pdf

Prí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

Fast Decoding of Gabidulin Codes

Autori: Wachter-Zeh, Antonia Afanassiev, Valentin Sidorenko, Vladimir a ďalší

Prispievatelia: Wachter-Zeh, Antonia Afanassiev, Valentin Sidorenko, Vladimir a ďalší

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00614474 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.433-442

Predmety: 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-00614474; https://hal.inria.fr/inria-00614474; https://hal.inria.fr/inria-00614474/document; https://hal.inria.fr/inria-00614474/file/13.pdf

Dostupnosť: https://hal.inria.fr/inria-00614474
https://hal.inria.fr/inria-00614474/document
https://hal.inria.fr/inria-00614474/file/13.pdf

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

Autori: Pham Sy, Lam Savin, Valentin Declercq, David a ďalší

Prispievatelia: Pham Sy, Lam Savin, Valentin Declercq, David a ďalší

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

Predmety: 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

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

On CCZ-equivalence of Addition mod 2n

Autori: 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)

Prispievatelia: 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

Predmety: 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

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

Optimal Arcs in Hjelmslev Spaces of Large Dimension

Autori: Boev, Stoyan Honold, Thomas Landjev, Ivan a ďalší

Prispievatelia: Boev, Stoyan Honold, Thomas Landjev, Ivan a ďalší

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

Predmety: 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

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

The Equivalence of Strong RSA and Factoring in the Generic Ring Model of Computation

Autori: Aggarwal, Divesh Maurer, Ueli Shparlinski, Igor a ďalší

Prispievatelia: Aggarwal, Divesh Maurer, Ueli Shparlinski, Igor a ďalší

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00607256 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.17-26

Predmety: 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-00607256; https://hal.inria.fr/inria-00607256; https://hal.inria.fr/inria-00607256/document; https://hal.inria.fr/inria-00607256/file/15.pdf

Dostupnosť: https://hal.inria.fr/inria-00607256
https://hal.inria.fr/inria-00607256/document
https://hal.inria.fr/inria-00607256/file/15.pdf

List-decoding of binary Goppa codes up to the binary Johnson bound

Autori: Augot, Daniel Barbier, Morgan Couvreur, Alain a ďalší

Prispievatelia: Augot, Daniel Barbier, Morgan Couvreur, Alain a ďalší

Zdroj: 2011 IEEE Information Theory Workshop. :229-233

Predmety: FOS: Computer and information sciences, Computer Science - Information Theory, Information Theory (cs.IT), binary Goppa codes, [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], 02 engineering and technology, 01 natural sciences, [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], ACM: E.: Data/E.4: CODING AND INFORMATION THEORY/E.4.1: Error control codes, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], error correcting codes, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], 0101 mathematics, list decoding

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/pdf/1012.3439
http://arxiv.org/abs/1012.3439
https://inria.hal.science/inria-00547106v1/document
https://inria.hal.science/inria-00547106v1
https://inria.hal.science/hal-00643794v1
https://doi.org/10.1109/itw.2011.6089384
https://inria.hal.science/hal-00643794v1/document

List decoding of a class of affine variety codes

Autori: Geil, Olav Thomsen, Casper Department of Mathematical Sciences Aalborg a ďalší

Prispievatelia: Geil, Olav Thomsen, Casper Department of Mathematical Sciences Aalborg a ďalší

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00614246 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.263-272

Predmety: Affine variety code, list decoding, multiplicity, Schwartz- Zippel bound, 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-00614246; https://hal.inria.fr/inria-00614246; https://hal.inria.fr/inria-00614246/document; https://hal.inria.fr/inria-00614246/file/82.pdf

Dostupnosť: https://hal.inria.fr/inria-00614246
https://hal.inria.fr/inria-00614246/document
https://hal.inria.fr/inria-00614246/file/82.pdf

An Analysis of the Naor-Naor-Lotspiech Subset Difference Algorithm (For Possibly Incomplete Binary Trees)

Autori: Bhattacherjee, Sanjay Sarkar, Palash Applied Statistics Unit a ďalší

Prispievatelia: Bhattacherjee, Sanjay Sarkar, Palash Applied Statistics Unit a ďalší

Zdroj: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00614487 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.483-492

Predmety: Broadcast encryption, subset di erence, recurrence, expected header length, asymptotic analysis, layered subset diff erence, 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-00614487; https://hal.inria.fr/inria-00614487; https://hal.inria.fr/inria-00614487/document; https://hal.inria.fr/inria-00614487/file/80.pdf

Dostupnosť: https://hal.inria.fr/inria-00614487
https://hal.inria.fr/inria-00614487/document
https://hal.inria.fr/inria-00614487/file/80.pdf

A Complete Characterization of Irreducible Cyclic Orbit Codes

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

Prispievatelia: 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

Predmety: 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

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

A Lower Bound for the Nonlinearity of Exponential Welch Costas Functions

Autori: Hakala, Risto Department of Information and Computer Science Aalto University

Prispievatelia: 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

Predmety: 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

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

Optimality of a 2-identifying code in the hexagonal grid

Autori: Ville, Junnila Laihonen, Tero Turku Centre for Computer Science a ďalší

Prispievatelia: Ville, Junnila Laihonen, Tero Turku Centre for Computer Science a ďalší

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

Predmety: 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

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

Cryptanalysis of Dual CRT-RSA

Autori: Santanu, Sarkar Maitra, Subhamoy Indian Statistical Institute Kolkata

Prispievatelia: 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

Predmety: 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

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

A Note on the Generalisation of the Guruswami–Sudan List Decoding Algorithm to Reed–Muller Codes

Autori: Augot, Daniel Stepanov, Michael Massimiliano Sala and Teo Mora and Ludovic Perret and Shojiro Sakata and Carlo Traverso a ďalší

Prispievatelia: Augot, Daniel Stepanov, Michael Massimiliano Sala and Teo Mora and Ludovic Perret and Shojiro Sakata and Carlo Traverso a ďalší

Zdroj: Gröbner Bases, Coding, and Cryptography ISBN: 9783540938057

Predmety: [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], ACM: E.: Data/E.4: CODING AND INFORMATION THEORY/E.4.1: Error control codes, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT]

Prístupová URL adresa: https://link.springer.com/chapter/10.1007/978-3-540-93806-4_27
https://hal.inria.fr/inria-00564022
https://dblp.uni-trier.de/db/books/collections/SSMTP2009.html#AugotS09
https://rd.springer.com/chapter/10.1007/978-3-540-93806-4_27
http://www.lix.polytechnique.fr/~augot/list-decode-RM.pdf
https://link.springer.com/content/pdf/10.1007%2F978-3-540-93806-4_27.pdf

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

Autori: Santanu, Sarkar Sourav Sen, Gupta Subhamoy, Maitra a ďalší

Prispievatelia: Santanu, Sarkar Sourav Sen, Gupta Subhamoy, Maitra a ďalší

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

Predmety: 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

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

Editorial

Autori: Augot, Daniel Canteaut, Anne Kyureghyan, Gohar a ďalší

Prispievatelia: Augot, Daniel Canteaut, Anne Kyureghyan, Gohar a ďalší

Predmety: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], ACM: E.: Data/E.3: DATA ENCRYPTION, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]

Prístupová URL adresa: https://inria.hal.science/hal-00741923v1
https://doi.org/10.1007/s10623-012-9731-1