Suchergebnisse - ACM: E.: Data/E.3: DATA ENCRYPTION/E.3.0: Code treating

Treffer weiter einschränken
  1. 1

    Memory Encryption: A Survey of Existing Techniques.

    Autoren: HENSON, MICHAEL TAYLOR, STEPHEN

    Quelle: ACM Computing Surveys; Apr2014, Vol. 46 Issue 4, p53:1-53:26, 26p, 5 Diagrams, 1 Chart

    Schlagwörter: DATA encryption, COMPUTER operating systems, COMPUTER hacking, COPROCESSORS, DATA protection

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  2. 2

    Unlocking the Potential of Fully Homomorphic Encryption: Exploring the transformational potential of FHE and the path toward adoption of its "stack".

    Autoren: GORANTALA, SHRUTHI SPRINGER, ROB GIPSON, BRYANT

    Quelle: Communications of the ACM; May2023, Vol. 66 Issue 5, p72-81, 10p, 1 Color Photograph, 4 Diagrams, 1 Chart

    Schlagwörter: DATA encryption, ENCRYPTION protocols, DATA security, COMPILERS (Computer programs)

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  3. 3

    Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers

    Autoren: Chen, Yuanmi Nguyen, Phong Q. Laboratoire d'informatique de l'école normale supérieure (LIENS) et al.

    Weitere Verfasser: Chen, Yuanmi Nguyen, Phong Q. Laboratoire d'informatique de l'école normale supérieure (LIENS) et al.

    Quelle: EUROCRYPT 2012 ; https://inria.hal.science/hal-00864374 ; EUROCRYPT 2012, IACR, Apr 2012, Cambridge, United Kingdom. pp.502-519, ⟨10.1007/978-3-642-29011-4_30⟩ ; http://link.springer.com/chapter/10.1007%2F978-3-642-29011-4_30

    Schlagwörter: Fully-homomorphic encryption, cryptanalysis, approximate gcd, ACM: E.: Data/E.3: DATA ENCRYPTION/E.3.0: Code breaking, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]

    Geographisches Schlagwort: Cambridge, United Kingdom

    Verfügbarkeit: https://inria.hal.science/hal-00864374
    https://inria.hal.science/hal-00864374v1/document
    https://inria.hal.science/hal-00864374v1/file/ChenNguyen.pdf
    https://doi.org/10.1007/978-3-642-29011-4_30

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  4. 4

    Transparent code authentication at the processor level.

    Autoren: Durahim, A. O. Savaş, E. Sunar, B. et al.

    Quelle: IET Computers & Digital Techniques (Institution of Engineering & Technology); Jul2009, Vol. 3 Issue 4, p354-372, 19p, 5 Diagrams, 7 Charts, 3 Graphs

    Schlagwörter: DATA encryption, ELECTRONIC systems, CACHE memory, COMPUTER software, COMPUTER systems

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  5. 5

    ShieldNVM: An Efficient and Fast Recoverable System for Secure Non-Volatile Memory.

    Autoren: FAN YANG YOUMIN CHEN HAIYU MAO et al.

    Quelle: ACM Transactions on Storage; Jun2020, Vol. 16 Issue 2, p1-31, 31p

    Schlagwörter: MESSAGE authentication codes, DATA encryption, METADATA, DATA protection, MEMORY, CACHE memory

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  6. 6

    Optimality of a 2-identifying code in the hexagonal grid

    Autoren: Ville, Junnila Laihonen, Tero Turku Centre for Computer Science et al.

    Weitere Verfasser: Ville, Junnila Laihonen, Tero Turku Centre for Computer Science 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]

    Geographisches Schlagwort: 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

    Verfügbarkeit: https://hal.inria.fr/inria-00607289
    https://hal.inria.fr/inria-00607289/document
    https://hal.inria.fr/inria-00607289/file/45.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  7. 7

    The non-gap sequence of a subcode of a generalized Reed-Solomon code

    Autoren: Marquez-Corbella, Irene Martinez-Moro, Edgar Pellikaan, Ruud et al.

    Weitere Verfasser: Marquez-Corbella, Irene Martinez-Moro, Edgar Pellikaan, Ruud et al.

    Quelle: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00608102 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.183-192

    Schlagwörter: gaps of a code, Berger-Loidreau cryptosystem, square code, GRS 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]

    Geographisches Schlagwort: Paris, France

    Relation: inria-00608102; https://hal.inria.fr/inria-00608102; https://hal.inria.fr/inria-00608102/document; https://hal.inria.fr/inria-00608102/file/117.pdf

    Verfügbarkeit: https://hal.inria.fr/inria-00608102
    https://hal.inria.fr/inria-00608102/document
    https://hal.inria.fr/inria-00608102/file/117.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  8. 8

    EFFECTS OF UNEQUAL BIT COSTS ON CHAIN CODE.

    Autoren: GHERAIBIA, MOHAMED YACINE

    Quelle: i-Manager's Journal on Image Processing; Apr-Jun2019, Vol. 6 Issue 2, p1-13, 13p

    Schlagwörter: CHAIN codes (Data compression), PATTERN perception, CONTOURS (Cartography), DATA encryption, INFORMATION retrieval

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  9. 9

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

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

    Weitere Verfasser: De Boeck, Maarten Department of Mathematics Gent/Ghent Universiteit Gent = Ghent University Belgium (UGENT)

    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]

    Geographisches Schlagwort: 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

    Verfügbarkeit: https://hal.inria.fr/inria-00607291
    https://hal.inria.fr/inria-00607291/document
    https://hal.inria.fr/inria-00607291/file/53.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  10. 10

    Characteristics of Invariant Weights Related to Code Equivalence over Rings

    Autoren: Mc Fadden, Cathy Greferath, Marcus Zumbragel, Jens et al.

    Weitere Verfasser: Mc Fadden, Cathy Greferath, Marcus Zumbragel, Jens et al.

    Quelle: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00607730 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.91-100

    Schlagwörter: Ring-Linear Codes, MacWilliams' Equivalence Theorem, Extension Theorem, Weights, 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]

    Geographisches Schlagwort: Paris, France

    Relation: inria-00607730; https://hal.inria.fr/inria-00607730; https://hal.inria.fr/inria-00607730/document; https://hal.inria.fr/inria-00607730/file/137.pdf

    Verfügbarkeit: https://hal.inria.fr/inria-00607730
    https://hal.inria.fr/inria-00607730/document
    https://hal.inria.fr/inria-00607730/file/137.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  11. 11

    WYSINWYX: What You See Is Not What You eXecute.

    Autoren: Balakrishnan, Gogul Reps, Thomas

    Quelle: ACM Transactions on Programming Languages & Systems; Aug2010, Vol. 32 Issue 6, p23-23:84, 84p, 13 Black and White Photographs, 11 Diagrams, 8 Charts, 1 Graph

    Schlagwörter: STATICS, DEBUGGING, ALGORITHMS, INFORMATION theory, DATA structures, FLOWGRAPHS, END-user computing, ELECTRONIC data processing, LICENSE agreements, DATA encryption

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  12. 12

    Physical Unclonable Functions-based Linear Encryption against Code Reuse Attacks.

    Autoren: Pengfei Qiu Yongqiang Lyu Jiliang Zhang et al.

    Quelle: DAC: Annual ACM/IEEE Design Automation Conference; Jun2016, p440-445, 6p

    Schlagwörter: DATA encryption, CODE reuse, COMPUTER security, COMPUTER architecture, COMPUTER programming

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  13. 13

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

    Autoren: Legeay, Matthieu Institut de Recherche Mathématique de Rennes (IRMAR) Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes) et al.

    Weitere Verfasser: Legeay, Matthieu Institut de Recherche Mathématique de Rennes (IRMAR) Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes) 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]

    Geographisches Schlagwort: Paris, France

    Verfügbarkeit: https://inria.hal.science/inria-00608107
    https://inria.hal.science/inria-00608107v1/document
    https://inria.hal.science/inria-00608107v1/file/22.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  14. 14

    On the weights of affine-variety codes and some Hermitian codes

    Autoren: Pellegrini, Marco Marcolla, Chiara Sala, Massimiliano et al.

    Weitere Verfasser: Pellegrini, Marco Marcolla, Chiara Sala, Massimiliano et al.

    Quelle: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00614257 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.273-282

    Schlagwörter: Affine-variety codes, linear code, distance, minimum-weight word, Hermitian 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]

    Geographisches Schlagwort: Paris, France

    Relation: inria-00614257; https://hal.inria.fr/inria-00614257; https://hal.inria.fr/inria-00614257/document; https://hal.inria.fr/inria-00614257/file/44.pdf

    Verfügbarkeit: https://hal.inria.fr/inria-00614257
    https://hal.inria.fr/inria-00614257/document
    https://hal.inria.fr/inria-00614257/file/44.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  15. 15

    Hopes, Fears, and Software Obfuscation.

    Autoren: BARAK, BOAZ

    Quelle: Communications of the ACM; Mar2016, Vol. 59 Issue 3, p88-96, 9p, 1 Color Photograph, 4 Diagrams, 1 Graph

    Schlagwörter: COMPUTER software, COMPILERS (Computer programs), DATA encryption, COMPUTER science, COMPUTER security

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  16. 16

    TrueErase: Leveraging an Auxiliary Data Path for Per-File Secure Deletion.

    Autoren: DIESBURG, SARAH MEYERS, CHRISTOPHER STANOVICH, MARK et al.

    Quelle: ACM Transactions on Storage; May2016, Vol. 12 Issue 4, p18:1-18:37, 37p

    Schlagwörter: INFORMATION retrieval, COMPUTATIONAL complexity, COMPUTER software, DATA security, DATA encryption

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  17. 17

    Algebraic Decoding of Negacyclic Codes over Z4

    Autoren: Byrne, Eimear Greferath, Marcus Zumbragel, Jens et al.

    Weitere Verfasser: Byrne, Eimear Greferath, Marcus Zumbragel, Jens 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]

    Geographisches Schlagwort: 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

    Verfügbarkeit: https://hal.inria.fr/inria-00607733
    https://hal.inria.fr/inria-00607733/document
    https://hal.inria.fr/inria-00607733/file/66.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  18. 18

    List decoding of a class of affine variety codes

    Autoren: Geil, Olav Thomsen, Casper Department of Mathematical Sciences Aalborg et al.

    Weitere Verfasser: Geil, Olav Thomsen, Casper Department of Mathematical Sciences Aalborg et al.

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

    Schlagwörter: 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]

    Geographisches Schlagwort: 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

    Verfügbarkeit: https://hal.inria.fr/inria-00614246
    https://hal.inria.fr/inria-00614246/document
    https://hal.inria.fr/inria-00614246/file/82.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  19. 19

    Some codes correcting single symmetric errors of limited magnitude

    Autoren: Kløve, Torleiv Luo, Jinquan Yari, Somaye et al.

    Weitere Verfasser: Kløve, Torleiv Luo, Jinquan Yari, Somaye et al.

    Quelle: WCC 2011 - Workshop on coding and cryptography ; https://hal.inria.fr/inria-00614390 ; WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.331-340

    Schlagwörter: Code, symmetric error, limited magnitude error, 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]

    Geographisches Schlagwort: Paris, France

    Relation: inria-00614390; https://hal.inria.fr/inria-00614390; https://hal.inria.fr/inria-00614390/document; https://hal.inria.fr/inria-00614390/file/38.pdf

    Verfügbarkeit: https://hal.inria.fr/inria-00614390
    https://hal.inria.fr/inria-00614390/document
    https://hal.inria.fr/inria-00614390/file/38.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  20. 20

    Novel Secure Code Encryption Techniques Using Crypto Based Indexed Table for Highly Secured Software.

    Autoren: Sasirekha, N. Hemalatha, M.

    Quelle: International Review on Computers & Software; Aug2013, Vol. 8 Issue 8, p1980-1990, 11p

    Schlagwörter: COMPUTER security, DATA encryption, CRYPTOGRAPHY, COMPUTER software, SOFTWARE protection, COMPUTER software security

    Nájsť tento článok vo Web of Science
    Zu den Favoriten

Suchwerkzeuge: