Suchergebnisse - "ACM: E.: Data/E.3: DATA ENCRYPTION"
-
1
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ComPAS'13 / SympA'15 - Symposium en Architectures nouvelles de machines ; https://inria.hal.science/hal-00772703 ; ComPAS'13 / SympA'15 - Symposium en Architectures nouvelles de machines, Jan 2013, Grenoble, France
Schlagwörter: opérateur arithmétique, test divisibilité, nombre multi-précision, implantation matérielle, circuit FPGA, ACM: B.: Hardware/B.2: ARITHMETIC AND LOGIC STRUCTURES, ACM: E.: Data/E.3: DATA ENCRYPTION, [INFO.INFO-AO]Computer Science [cs]/Computer Arithmetic, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [SPI.NANO]Engineering Sciences [physics]/Micro and nanotechnologies/Microelectronics
-
2
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Africacrypt 2012 ; https://inria.hal.science/hal-00684486 ; Africacrypt 2012, Jul 2012, Ifrane, Morocco. pp.19-34, ⟨10.1007/978-3-642-31410-0_2⟩
Schlagwörter: ACM: E.: Data/E.3: DATA ENCRYPTION, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]
-
3
Autoren: et al.
Weitere Verfasser: et al.
Quelle: International Workshop on the Arithmetic of Finite Fields ; https://inria.hal.science/hal-00686645 ; International Workshop on the Arithmetic of Finite Fields, Jul 2012, Bochum, Germany. pp.45-63, ⟨10.1007/978-3-642-31662-3_4⟩
Schlagwörter: ACM: E.: Data/E.3: DATA ENCRYPTION, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]
-
4
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 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
Schlagwörter: 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]
-
5
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 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
Schlagwörter: 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]
-
6
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 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
Schlagwörter: 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]
-
7
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 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
Schlagwörter: 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]
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
-
8
Autoren:
Weitere Verfasser:
Quelle: 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
Schlagwörter: 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]
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
-
9
Autoren:
Weitere Verfasser:
Quelle: 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
Schlagwörter: 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]
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
-
10
Autoren:
Weitere Verfasser:
Quelle: 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
Schlagwörter: 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]
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
-
11
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 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
Schlagwörter: 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]
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
-
12
Autoren:
Weitere Verfasser:
Quelle: 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
Schlagwörter: 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]
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
-
13
Autoren:
Weitere Verfasser:
Quelle: 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
Schlagwörter: 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]
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
-
14
Autoren:
Weitere Verfasser:
Quelle: 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
Schlagwörter: 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]
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
-
15
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 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
Schlagwörter: 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]
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
-
16
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 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
Schlagwörter: 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]
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
-
17
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 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
Schlagwörter: 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]
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
-
18
Autoren:
Weitere Verfasser:
Quelle: 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
Schlagwörter: 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]
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
-
19
Autoren:
Weitere Verfasser:
Quelle: 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
Schlagwörter: 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]
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
-
20
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 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
Schlagwörter: 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]
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
Nájsť tento článok vo Web of Science