{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":13,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":13,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"f642e8154779","filters":{"venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems"}},"results":[{"id":"W4251236654","doi":"10.46586/tches.v2018.i3.547-572","title":"SIFA: Exploiting Ineffective Fault Inductions on Symmetric Cryptography","year":2018,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Infineon Technologies (Canada)","funders":"Bundesministerium für Verkehr, Innovation und Technologie; Österreichische Forschungsförderungsgesellschaft; Bundesministerium für Wissenschaft, Forschung und Wirtschaft; Austrian Science Fund; European Commission","keywords":"Fault (geology); Computer science; Exploit; Byte; Fault model; Fault coverage; Computer security; Stuck-at fault; Fault indicator; Cryptography; Fault detection and isolation; Engineering; Artificial intelligence; Computer hardware; Seismology","retraction":null,"screen_n_in":null,"score":{"opus":0.02469502833058283,"gpt":0.2745805529607446,"spread":0.2498855246301618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008590337,0.0005691283,0.0005536755,0.003268441,0.001908632,0.0006929308,0.0006178742,0.0002701752,0.00006629732],"category_scores_gemma":[0.0000474532,0.0005329038,0.0004317325,0.006269069,0.0003711277,0.0008484744,0.00002679407,0.0006791039,0.00007448118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006032614,"about_ca_system_score_gemma":0.00007035519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003270178,"about_ca_topic_score_gemma":0.0001332899,"domain_scores_codex":[0.9959971,0.0004795557,0.0007663821,0.001173401,0.0007864216,0.0007971072],"domain_scores_gemma":[0.9972243,0.0005703703,0.0002507431,0.001058282,0.0004996124,0.0003966861],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002355258,0.002092902,0.001669498,0.0003192358,0.001521519,0.00005702762,0.01537284,0.0009953753,0.00184329,0.8190723,0.002313557,0.1545069],"study_design_scores_gemma":[0.04318347,0.04752032,0.05414979,0.007427576,0.002798316,0.002965703,0.1311449,0.2375403,0.02701847,0.1563405,0.2662729,0.02363781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09980541,0.0002407092,0.8928243,0.0003271574,0.002176583,0.0009702657,0.00009681149,0.0006727029,0.002886059],"genre_scores_gemma":[0.9921808,0.0002355148,0.00635103,0.0003205306,0.0003389607,0.0004937776,0.00001505908,0.00004677125,0.00001751721],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8923754,"threshold_uncertainty_score":0.9997122,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4235846187","doi":"10.46586/tches.v2018.i1.142-174","title":"Practical CCA2-Secure and Masked Ring-LWE Implementation","year":2018,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Infineon Technologies (Canada)","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Encryption; Ciphertext; Learning with errors; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.02994930005431462,"gpt":0.3295585039156693,"spread":0.2996092038613546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006870823,0.0003316492,0.0003334329,0.0006426371,0.0009692749,0.0006539173,0.0002471555,0.0001586067,0.0001098427],"category_scores_gemma":[0.00001175043,0.0003123625,0.0001354441,0.00107541,0.0002592465,0.000837624,0.00002415506,0.000314086,0.00002089626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002598361,"about_ca_system_score_gemma":0.00007407794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002850467,"about_ca_topic_score_gemma":0.0004486095,"domain_scores_codex":[0.9974154,0.0002717426,0.0005634882,0.0007541788,0.0004777826,0.0005174499],"domain_scores_gemma":[0.9985151,0.0002055114,0.000164556,0.0005803975,0.0002355454,0.0002988692],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002374674,0.001029171,0.005179109,0.0005634892,0.001160734,0.00009814031,0.02681672,0.00005457015,0.002480377,0.8217279,0.006907346,0.133745],"study_design_scores_gemma":[0.03142027,0.013763,0.05614705,0.00159252,0.001835304,0.004761796,0.1287815,0.2080377,0.009555233,0.05987006,0.4737276,0.01050802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0567924,0.0001739007,0.9396471,0.001071571,0.0008268279,0.0006625791,0.00008226909,0.0002792591,0.0004640259],"genre_scores_gemma":[0.9815319,0.0003223383,0.01753676,0.000233671,0.0001508349,0.000165921,0.00001586399,0.00002444087,0.00001826817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9247395,"threshold_uncertainty_score":0.9999328,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4239728551","doi":"10.46586/tches.v2020.i3.97-120","title":"Splitting the Interpose PUF: A Novel Modeling Attack Strategy","year":2020,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Physical Unclonable Functions (PUFs) and Hardware Security","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Freie Universität Berlin; Technische Universität Berlin; Banting and Best Diabetes Centre, University of Toronto; Bundesministerium für Bildung und Forschung","keywords":"Arbiter; Reliability (semiconductor); Engineering; Exclusive or; Computer science; Embedded system; Artificial intelligence; Computer hardware; Algorithm; Logic gate","retraction":null,"screen_n_in":null,"score":{"opus":0.05897930967687551,"gpt":0.256521135042555,"spread":0.1975418253656795,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004413816,0.0003996333,0.0004506794,0.0002009024,0.0009255711,0.0007589606,0.0008123048,0.0001591446,0.0000207691],"category_scores_gemma":[0.00002710467,0.0003033945,0.0003400365,0.001362309,0.0001130064,0.0007521417,0.00003857126,0.0007602904,0.0000538939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003136207,"about_ca_system_score_gemma":0.0001004086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001881143,"about_ca_topic_score_gemma":0.00003912196,"domain_scores_codex":[0.9972956,0.0001987585,0.0005803925,0.0008587365,0.0005160804,0.0005504659],"domain_scores_gemma":[0.9983207,0.0002317166,0.0001273419,0.0007187774,0.0002125746,0.000388902],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003725907,0.001576092,0.0001208975,0.001072821,0.001471756,0.00008573088,0.02498391,0.6652526,0.005806667,0.2145374,0.001779275,0.08294021],"study_design_scores_gemma":[0.0006357647,0.0003067008,0.00002383513,0.0001571374,0.00006682699,0.00004746066,0.002001463,0.9891202,0.00009015437,0.0008012654,0.006303686,0.0004454757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01446503,0.0004114214,0.9806946,0.001724513,0.0006914159,0.00052647,0.00005851293,0.0004888595,0.0009392031],"genre_scores_gemma":[0.9969411,0.0001085386,0.001739289,0.0007107756,0.0002869665,0.0001333185,0.000006498869,0.00003136383,0.00004208315],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9824761,"threshold_uncertainty_score":0.9999418,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4237491555","doi":"10.46586/tches.v2018.i2.298-336","title":"Smashing the Implementation Records of AES S-box","year":2018,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Advancements in Semiconductor Devices and Circuit Design","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"S-box; Heuristics; Computer science; White box; Block (permutation group theory); Box model; Logic gate; Minification; Black box; Algorithm; Computer engineering; Mathematics; Block cipher; Programming language; Cryptography; Operating system; Software engineering; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01734270153104599,"gpt":0.2665342913171062,"spread":0.2491915897860602,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002771051,0.00017752,0.0002088682,0.0001620662,0.0002496586,0.00006369392,0.0001407606,0.00007548649,0.0001593222],"category_scores_gemma":[0.000002120721,0.0001385737,0.00008738523,0.000369992,0.0001142216,0.0002047573,0.000001725338,0.0001561683,0.000008782468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000205108,"about_ca_system_score_gemma":0.00001057349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000960189,"about_ca_topic_score_gemma":0.0001206958,"domain_scores_codex":[0.9989245,0.0000694353,0.000378631,0.0001921972,0.0002053477,0.0002298799],"domain_scores_gemma":[0.9994115,0.00008506756,0.0000711864,0.0002866757,0.00008635571,0.00005918537],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002352027,0.0004324417,0.008027357,0.003058422,0.004235125,0.00001650623,0.05285224,0.03336438,0.1436276,0.02290363,0.007237602,0.7240095],"study_design_scores_gemma":[0.009920471,0.004439988,0.007338128,0.003598148,0.002114124,0.0003737646,0.2974058,0.07195528,0.2039037,0.008719572,0.3843862,0.005844793],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2398404,0.001451781,0.7528251,0.00003073161,0.002488206,0.0006115054,0.0001083351,0.0002584134,0.002385529],"genre_scores_gemma":[0.9989455,0.0004064908,0.0003131775,0.00003145741,0.000150439,0.00008396604,0.000006663383,0.00003105556,0.00003123108],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7591051,"threshold_uncertainty_score":0.565087,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4255021787","doi":"10.46586/tches.v2020.i3.269-306","title":"Parameterized Hardware Accelerators for Lattice-Based Cryptography and Their Application to the HW/SW Co-Design of qTESLA","year":2020,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Speedup; Computer science; Parameterized complexity; Field-programmable gate array; Cryptography; Software; Parallel computing; Computer hardware; Embedded system; Algorithm; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.03786901518055814,"gpt":0.2610911896598944,"spread":0.2232221744793362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007824144,0.0004562601,0.000636526,0.000500404,0.0006323031,0.0004346797,0.0008010481,0.0002016895,0.000006605703],"category_scores_gemma":[0.00003812415,0.0003390206,0.0003589666,0.001956384,0.0002032882,0.0003913747,0.00001964039,0.0002951606,0.000004443775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001014214,"about_ca_system_score_gemma":0.0000641145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004835986,"about_ca_topic_score_gemma":0.00001522493,"domain_scores_codex":[0.9971991,0.0003949625,0.0006651172,0.0009244917,0.0003668768,0.0004494889],"domain_scores_gemma":[0.9972921,0.0008930123,0.000245006,0.0009103937,0.0002481148,0.0004113998],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00873596,0.003919511,0.003249697,0.00834122,0.005553644,0.00002290539,0.08005124,0.0689282,0.10285,0.3949874,0.01419872,0.3091614],"study_design_scores_gemma":[0.01082598,0.006166772,0.001783375,0.0008074595,0.0005957274,0.0000524422,0.009253496,0.8249976,0.02833186,0.01094489,0.102708,0.003532433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006228196,0.0005752914,0.9876985,0.001524177,0.0002274182,0.002707702,0.0007372113,0.0002764319,0.00002504751],"genre_scores_gemma":[0.958218,0.0001466849,0.03931738,0.0009925248,0.00007756807,0.001168049,0.00004297164,0.00003637218,4.49652e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9519898,"threshold_uncertainty_score":0.9999062,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2979200095","doi":"10.46586/tches.v2019.i4.126-153","title":"On-Device Power Analysis Across Hardware Security Domains.","year":2019,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Power analysis; Computer science; Side channel attack; Embedded system; Hardware security module; Microcontroller; Advanced Encryption Standard; Cryptography; Encryption; Computer hardware; Sample (material); Chip; Power (physics); Computer security; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.0115316641484082,"gpt":0.2760456177622211,"spread":0.2645139536138129,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001015394,0.000574854,0.0008357246,0.001287432,0.0009269463,0.0009043424,0.0008393356,0.0002843164,0.0003428514],"category_scores_gemma":[0.00001299521,0.0005309751,0.0008139091,0.004596879,0.0001404262,0.0007367788,0.00003487368,0.0006241589,0.0001474327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006009511,"about_ca_system_score_gemma":0.00006536679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003905954,"about_ca_topic_score_gemma":0.0003520094,"domain_scores_codex":[0.9956214,0.0003938884,0.0008161491,0.001316155,0.0009588315,0.0008935484],"domain_scores_gemma":[0.9969194,0.0004444131,0.0002491504,0.001678411,0.0003007814,0.0004078471],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007177906,0.004589683,0.03114305,0.001339576,0.01604111,0.0002747523,0.08806602,0.02588786,0.0009452638,0.8063056,0.004493775,0.02019556],"study_design_scores_gemma":[0.0384075,0.01237609,0.09485435,0.002754869,0.00630735,0.0008845247,0.1277739,0.3539499,0.00228187,0.07105827,0.2692134,0.0201379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3950554,0.0002869236,0.5998353,0.0002830392,0.001266294,0.0008965821,0.0004130419,0.0004254908,0.001537875],"genre_scores_gemma":[0.9978065,0.0001540625,0.001192542,0.0004689808,0.00004077122,0.000181177,0.00004027939,0.00003576909,0.00007988865],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7352473,"threshold_uncertainty_score":0.9997142,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4323310115","doi":"10.46586/tches.v2023.i2.358-380","title":"Speeding Up Multi-Scalar Multiplication over Fixed Points Towards Efficient zkSNARKs","year":2023,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Precomputation; Scalar multiplication; Computer science; Scalar (mathematics); Fixed point; Computation; Elliptic curve; Speedup; Context (archaeology); Arithmetic; Parallel computing; Mathematics; Algorithm; Pure mathematics; Geometry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02925715689697439,"gpt":0.2748435390671737,"spread":0.2455863821701993,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008968023,0.0004247655,0.0004512957,0.001374315,0.0008059452,0.0004688401,0.000606021,0.0002878061,0.00003520536],"category_scores_gemma":[0.00002914667,0.000383335,0.0004029156,0.002983925,0.0001506235,0.0002807129,0.00003361906,0.0004539682,0.0001373269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003899107,"about_ca_system_score_gemma":0.00004498527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000188428,"about_ca_topic_score_gemma":0.00002322037,"domain_scores_codex":[0.9967695,0.0002505607,0.0006078706,0.0009921045,0.000689393,0.0006905065],"domain_scores_gemma":[0.9981691,0.0002539956,0.000157651,0.0008873913,0.000185553,0.0003463579],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006705042,0.005138143,0.006510585,0.003414167,0.003895721,0.0005751112,0.05920145,0.1754704,0.03935305,0.09032018,0.01299416,0.6024566],"study_design_scores_gemma":[0.004331795,0.0003721621,0.0388101,0.0007551266,0.0001689077,0.0001483311,0.002917468,0.9341702,0.002685302,0.0006265953,0.01342818,0.001585811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06744315,0.0004777484,0.926961,0.0005984965,0.002355378,0.0007937841,0.00005787265,0.001092441,0.0002201069],"genre_scores_gemma":[0.9921196,0.000461117,0.006793235,0.0001025467,0.00009358951,0.0002319097,0.00001793973,0.00004315265,0.0001369553],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9246764,"threshold_uncertainty_score":0.9998618,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3099913548","doi":"10.46586/tches.v2022.i1.1-27","title":"Quantum Period Finding against Symmetric Primitives in Practice","year":2021,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Clarendon Fund; University of Oxford","keywords":"Block cipher; Cryptanalysis; Computer science; Qubit; NIST; Symmetric-key algorithm; Linear cryptanalysis; Collision attack; Key (lock); Theoretical computer science; Cryptography; Quantum; Algorithm; Public-key cryptography; Computer security; Cryptographic hash function; Encryption; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01520485437874709,"gpt":0.2564273949056573,"spread":0.2412225405269102,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006988372,0.0003204696,0.0004308804,0.0009593135,0.0004931375,0.0006061615,0.0003716472,0.0001707073,0.00000487036],"category_scores_gemma":[0.0001081865,0.0003062199,0.0001914294,0.002947959,0.00007186308,0.0005065224,0.0000255246,0.0006617269,0.00001241473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004293229,"about_ca_system_score_gemma":0.0001520589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005752207,"about_ca_topic_score_gemma":0.00001967687,"domain_scores_codex":[0.9970934,0.0005715818,0.0005073852,0.0008321138,0.0004695704,0.0005259792],"domain_scores_gemma":[0.9982187,0.0006452,0.0001463231,0.0005954049,0.0001976561,0.0001966958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001628804,0.003129488,0.001340853,0.001186567,0.00123109,0.004272743,0.0406268,0.1710615,0.003724431,0.2198294,0.000330351,0.5531039],"study_design_scores_gemma":[0.002126408,0.0004466846,0.002506009,0.001419525,0.00009069002,0.00145216,0.01145415,0.9591479,0.0006634091,0.001108955,0.01823318,0.001350936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06754048,0.002597016,0.92492,0.001108782,0.001396012,0.0003217996,0.00002158436,0.0003012588,0.001793102],"genre_scores_gemma":[0.983703,0.0005888616,0.01521076,0.0002771201,0.00008785492,0.00005355072,0.00000560135,0.00002626589,0.00004705407],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9161624,"threshold_uncertainty_score":0.999939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4380077763","doi":"10.46586/tches.v2023.i3.246-269","title":"Vectorized and Parallel Computation of Large Smooth-Degree Isogenies using Precedence-Constrained Scheduling","year":2023,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; Impact Fund","keywords":"Parallel computing; Isogeny; Computer science; Computation; Multi-core processor; Concurrency; Scheduling (production processes); Synchronization (alternating current); Parallelism (grammar); Implementation; Distributed computing; Algorithm; Programming language; Mathematics; Elliptic curve; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.04606353306043007,"gpt":0.2983112433225207,"spread":0.2522477102620906,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007034187,0.0002367824,0.0003931887,0.0007098511,0.0004505689,0.0001950731,0.0002281642,0.0001532607,0.00000251623],"category_scores_gemma":[0.00002156154,0.0002333433,0.0001187956,0.001274784,0.0001188402,0.0003843564,0.00001974052,0.0001886788,0.000002466395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001569271,"about_ca_system_score_gemma":0.00005844749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007470371,"about_ca_topic_score_gemma":0.000009637335,"domain_scores_codex":[0.9981517,0.0002399155,0.0004955459,0.0004697609,0.0003090887,0.000334027],"domain_scores_gemma":[0.999002,0.0002094645,0.0001955058,0.0002885651,0.000181559,0.0001229331],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001398681,0.000328078,0.001561691,0.001032868,0.0005363767,0.00002789256,0.009000825,0.9339325,0.00694876,0.02418593,0.0001132552,0.02219197],"study_design_scores_gemma":[0.000834413,0.0001465128,0.0004834859,0.0003875195,0.00003484219,0.00003234063,0.0006857926,0.9957336,0.0003641114,0.0009263528,0.00007564425,0.000295411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07151268,0.0004121079,0.926432,0.00007343862,0.000361177,0.0003556415,0.00002431787,0.0007159954,0.0001126424],"genre_scores_gemma":[0.9062497,0.0003687688,0.09326459,0.00001843736,0.00002991373,0.00003390363,0.000006729926,0.00001733341,0.00001062197],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.834737,"threshold_uncertainty_score":0.9515464,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402272061","doi":"10.46586/tches.v2024.i4.737-762","title":"Faster Complete Addition Laws for Montgomery Curves","year":2024,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Law; Mathematics; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.02291798211673549,"gpt":0.2509012413226303,"spread":0.2279832592058948,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004474691,0.0003197693,0.0003701476,0.0007329602,0.0004673372,0.0006241981,0.0003517579,0.000155983,0.00004573422],"category_scores_gemma":[0.000006825224,0.0002735686,0.0004289976,0.001049165,0.0001241742,0.000507163,0.000008942487,0.000292355,0.00004374272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001739383,"about_ca_system_score_gemma":0.00003861833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005362601,"about_ca_topic_score_gemma":0.00003036131,"domain_scores_codex":[0.9978715,0.0001557571,0.0004425203,0.0007337729,0.0003609966,0.000435524],"domain_scores_gemma":[0.9986461,0.0004586744,0.00006057474,0.0005281265,0.0001116548,0.0001948933],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002663949,0.001236243,0.0001106686,0.01766985,0.003479715,0.0002672034,0.007154285,0.003505327,0.004760939,0.3760597,0.0835006,0.501989],"study_design_scores_gemma":[0.002392756,0.001627103,0.0007760172,0.009788672,0.0006297731,0.0006344432,0.001712249,0.2641691,0.0007153144,0.0144196,0.700693,0.002441974],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007076782,0.01001832,0.9835662,0.001263888,0.002001146,0.0008527032,0.0004048824,0.0006430301,0.0005421087],"genre_scores_gemma":[0.9894163,0.002522883,0.00620811,0.0004280982,0.0002140877,0.0008866816,0.00005771611,0.00005047835,0.00021565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9887086,"threshold_uncertainty_score":0.9999716,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4404621259","doi":"10.46586/tches.v2024.i4.763-794","title":"Know-Thy-Basis: Decomposing F26 for Lightweight S-box Implementation","year":2024,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Engineering and Physical Sciences Research Council","keywords":"Extension (predicate logic); Field (mathematics); Computer science; Basis (linear algebra); Tower; S-box; Normal basis; Field extension; Affine transformation; Process (computing); Elegance; Arithmetic; Discrete mathematics; Theoretical computer science; Algebra over a field; Mathematics; Cryptography; Algorithm; Pure mathematics; Programming language; Block cipher; Geometry; Galois module; Structural engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0177697006325679,"gpt":0.3087615992298445,"spread":0.2909918985972766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007481828,0.0003898166,0.00038061,0.001166683,0.0009265238,0.001387316,0.000392067,0.000154382,0.000065447],"category_scores_gemma":[0.000004358596,0.0003617366,0.0004075374,0.001530855,0.0000769765,0.0008950357,0.00001295391,0.0002701022,0.00001859009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005760637,"about_ca_system_score_gemma":0.0001159357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001720751,"about_ca_topic_score_gemma":0.0002334248,"domain_scores_codex":[0.9971918,0.0001735691,0.0007307111,0.0008874,0.0004303751,0.000586077],"domain_scores_gemma":[0.9985408,0.0003863467,0.000104784,0.0005499231,0.0001846701,0.000233546],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008761371,0.000448416,0.0002917219,0.001511624,0.001298793,0.00004684709,0.01392812,0.0005926385,0.003025522,0.5458519,0.006277961,0.4266388],"study_design_scores_gemma":[0.005968754,0.002393451,0.0007965823,0.002147077,0.0009773336,0.0005301007,0.01838743,0.1911746,0.01089801,0.03109857,0.7320687,0.003559498],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009062321,0.0030746,0.9822124,0.0009014161,0.002407609,0.001207201,0.000251832,0.0006630867,0.0002195522],"genre_scores_gemma":[0.9774186,0.0007963928,0.02037321,0.0001581478,0.0002016923,0.0008854201,0.000072356,0.00004936279,0.00004479428],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9683563,"threshold_uncertainty_score":0.9998835,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4411157337","doi":"10.46586/tches.v2025.i3.493-515","title":"Accelerating EdDSA Signature Verification with Faster Scalar Size Halving","year":2025,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Signature (topology); Scalar (mathematics); Computer science; Mathematics; Physics; Algorithm; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.009931151980072331,"gpt":0.2435255318692568,"spread":0.2335943798891845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003686004,0.0002894565,0.0003018358,0.000429095,0.0005747592,0.0007796426,0.000505193,0.0002293588,0.00000927333],"category_scores_gemma":[0.00002649227,0.0002310944,0.00009492092,0.001330915,0.00007652779,0.0007363606,0.00001391943,0.0005389654,0.000003320345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003844942,"about_ca_system_score_gemma":0.00007347659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005009694,"about_ca_topic_score_gemma":0.00002125065,"domain_scores_codex":[0.998193,0.0001608974,0.0003434869,0.0006425097,0.0003343075,0.0003257466],"domain_scores_gemma":[0.9987012,0.0002418765,0.0001230303,0.0006153861,0.0002228343,0.0000956733],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005039974,0.001088905,0.00185464,0.003916429,0.00155052,0.0002089694,0.01432578,0.004938542,0.08344149,0.292783,0.003018846,0.5923689],"study_design_scores_gemma":[0.01494534,0.004234025,0.006390727,0.03468831,0.001666771,0.00145642,0.02090773,0.5606565,0.2301124,0.06607603,0.04607083,0.01279499],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00356594,0.002377187,0.9910565,0.0005671858,0.0003949022,0.000460171,0.000008500894,0.0008375124,0.0007320996],"genre_scores_gemma":[0.8879113,0.00005711526,0.1113651,0.0002860745,0.00003880206,0.000146073,0.000003092411,0.00001816176,0.0001743272],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8843453,"threshold_uncertainty_score":0.9423754,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402271882","doi":"10.46586/tches.v2024.i4.382-424","title":"Phase Modulation Side Channels: Jittery JTAG for On-Chip Voltage Measurements","year":2024,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Semiconductor materials and devices","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Chip; Materials science; Voltage; Modulation (music); Phase (matter); Optoelectronics; Electrical engineering; Chemistry; Engineering; Physics; Acoustics","retraction":null,"screen_n_in":null,"score":{"opus":0.05146759419165013,"gpt":0.280753786283362,"spread":0.2292861920917119,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003437485,0.0003163004,0.0003314579,0.000474703,0.0001914657,0.0003952422,0.00009229047,0.0001687243,0.00004494365],"category_scores_gemma":[0.000006169122,0.0002887706,0.0001869415,0.0003007508,0.00002829037,0.0002782131,0.000001318153,0.0001643495,0.00003146485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003953012,"about_ca_system_score_gemma":0.00001456023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003520146,"about_ca_topic_score_gemma":0.00001251169,"domain_scores_codex":[0.9985657,0.00004759824,0.0004022477,0.0003923704,0.0002683499,0.0003237556],"domain_scores_gemma":[0.9993872,0.0001317854,0.00003194104,0.0002552091,0.00006153639,0.0001322981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004420781,0.0007098783,0.00004057509,0.008235842,0.002370032,0.00003978461,0.004886333,0.189799,0.7371362,0.002109695,0.004659074,0.04957159],"study_design_scores_gemma":[0.00807441,0.002231318,0.0001254905,0.005710782,0.0008342579,0.0001197071,0.003639634,0.7843267,0.1110966,0.002836979,0.07800071,0.003003473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.53688,0.00237564,0.4490194,0.00004616741,0.008516318,0.001052367,0.0004619818,0.001115439,0.0005326496],"genre_scores_gemma":[0.9986556,0.0001614618,0.000105836,0.00004780315,0.0004236337,0.0004242259,0.00005112644,0.000082915,0.00004740442],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6260396,"threshold_uncertainty_score":0.9999564,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}