{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":19,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":19,"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":"3655c7f74ef4","filters":{"venue":"Journal of Cryptographic Engineering"}},"results":[{"id":"W3197657782","doi":"10.1007/s13389-021-00271-w","title":"The SQALE of CSIDH: sublinear Vélu quantum-resistant isogeny action with low exponents","year":2021,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Clarendon Fund; European Commission; University of Waterloo; University of Oxford; Consejo Nacional de Ciencia y Tecnología; H2020 European Research Council; St. Cross College, University of Oxford","keywords":"Isogeny; Mathematics; Quantum; Sublinear function; NIST; Post-quantum cryptography; Discrete mathematics; Computer science; Elliptic curve; Pure mathematics; Quantum computer; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01231776596756729,"gpt":0.2427799771552245,"spread":0.2304622111876573,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005910181,0.0001495952,0.0002448848,0.0003770537,0.0001618879,0.0001657194,0.0004909239,0.00004581232,0.000009742432],"category_scores_gemma":[0.00007084887,0.0001051923,0.0002268153,0.001458753,0.00004445046,0.0004777478,0.00006845484,0.0002773626,4.138031e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000218641,"about_ca_system_score_gemma":0.0001282122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001089728,"about_ca_topic_score_gemma":0.00003801948,"domain_scores_codex":[0.9983209,0.00005466478,0.0006141454,0.0001519753,0.0005905125,0.000267738],"domain_scores_gemma":[0.9983726,0.0001943461,0.0003962061,0.0003806031,0.0005444926,0.0001117474],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0004702003,0.001072253,0.01792303,0.0005945964,0.001852147,0.0006006678,0.003798202,0.02080751,0.5130901,0.4204189,0.0008981369,0.01847426],"study_design_scores_gemma":[0.01436036,0.004796822,0.3460619,0.002577978,0.0006404136,0.003651736,0.007750491,0.2512924,0.280113,0.0207568,0.06505207,0.002945964],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6162161,0.001007577,0.3819588,0.0003134517,0.000407013,0.00005705065,0.00000238436,0.00002076536,0.00001680282],"genre_scores_gemma":[0.9777852,0.0007077971,0.02138244,0.00001829051,0.00008505461,0.000003536093,0.000001199093,0.00001302743,0.000003479338],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.399662,"threshold_uncertainty_score":0.4289618,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999613060","doi":"10.1007/s13389-011-0017-8","title":"Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction","year":2011,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Consejo Nacional de Ciencia y Tecnología; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; University of Waterloo; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Scalar multiplication; Elliptic curve cryptography; Edwards curve; Arithmetic; Elliptic curve; Elliptic curve point multiplication; Parallel computing; Computer science; Binary number; Side channel attack; Multiplication (music); Curve25519; Mathematics; Cryptography; Algorithm; Public-key cryptography; Encryption; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02652695602035042,"gpt":0.2340954477578505,"spread":0.2075684917375001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005344739,0.0001975653,0.0002283398,0.0006918443,0.0001581067,0.00008847602,0.0007639508,0.00009511761,0.000005387595],"category_scores_gemma":[0.00006385953,0.0001495444,0.0002706105,0.00149715,0.00005737474,0.0009600141,0.00008948102,0.0004075369,9.161196e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003868046,"about_ca_system_score_gemma":0.00005597488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006031783,"about_ca_topic_score_gemma":0.000002710704,"domain_scores_codex":[0.9985021,0.00004655173,0.0005563395,0.0002155634,0.0004153138,0.0002641219],"domain_scores_gemma":[0.99869,0.00008846505,0.0004394365,0.000423698,0.0002013193,0.0001570698],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0001369111,0.0006207106,0.1468981,0.001014948,0.001083152,0.00009093747,0.009170949,0.1040616,0.5939267,0.05716816,0.0005503571,0.08527755],"study_design_scores_gemma":[0.001476123,0.000215427,0.5289707,0.001361334,0.0002115811,0.0007571293,0.0001966837,0.4467318,0.01621336,0.002430273,0.0008251281,0.0006104718],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5071194,0.002276824,0.4897794,0.0001355968,0.0005045275,0.0001164804,2.818113e-7,0.00004913579,0.00001828278],"genre_scores_gemma":[0.8865669,0.0008832482,0.1122154,0.00004922132,0.0002622768,0.000002920579,4.081525e-7,0.00001828666,0.000001291794],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5777133,"threshold_uncertainty_score":0.6098242,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003234729","doi":"10.1007/s13389-014-0087-5","title":"Synchronous sampling and clock recovery of internal oscillators for side channel analysis and fault injection","year":2014,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clock domain crossing; CPU multiplier; Digital clock manager; Computer science; Oscilloscope; Clock drift; Glitch; Synchronous circuit; Microcontroller; Fault (geology); Sampling (signal processing); Crystal oscillator; Real-time computing; Clock gating; Embedded system; Clock signal; Jitter; Detector; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.008588975450393664,"gpt":0.2431923204891606,"spread":0.2346033450387669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000728661,0.0001220211,0.0003225948,0.001401064,0.00007073518,0.00008970051,0.0001682577,0.00005100324,9.286022e-7],"category_scores_gemma":[0.0001091271,0.000114101,0.0002197317,0.0009118029,0.00003001902,0.0003515162,0.00005475299,0.0001348864,1.933833e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001385877,"about_ca_system_score_gemma":0.00001484155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004112524,"about_ca_topic_score_gemma":0.00002972955,"domain_scores_codex":[0.9989693,0.00002272785,0.0005037745,0.0001537125,0.000182828,0.0001676757],"domain_scores_gemma":[0.9989969,0.0002627498,0.0003296181,0.0001328833,0.0001800607,0.000097788],"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.0002917351,0.0003487584,0.2102288,0.001385263,0.007661215,0.00001164333,0.008225788,0.3757601,0.038475,0.1410595,0.00006559923,0.2164865],"study_design_scores_gemma":[0.002029516,0.001867665,0.2054641,0.000271651,0.0007046773,0.0003046664,0.0003618234,0.7720529,0.001938613,0.0133986,0.001057026,0.0005486869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4509082,0.0002257651,0.5486363,0.00002518512,0.000149092,0.00004090218,0.000001754333,0.000009053348,0.000003694894],"genre_scores_gemma":[0.9200881,0.0001790595,0.07962532,0.00001854362,0.00007856521,0.000002631213,5.574934e-7,0.000006942597,2.851498e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4691799,"threshold_uncertainty_score":0.4652905,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2594864105","doi":"10.1007/s13389-017-0154-9","title":"Montgomery reduction within the context of residue number system arithmetic","year":2017,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Residue number system; Arithmetic; Computer science; Reduction (mathematics); Cryptography; Implementation; Context (archaeology); Parallel computing; Theoretical computer science; Mathematics; Algorithm; Programming language; History","retraction":null,"screen_n_in":null,"score":{"opus":0.00809598719957067,"gpt":0.2195884021804402,"spread":0.2114924149808696,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001240218,0.0001827608,0.0003827986,0.0004080074,0.0003039848,0.0002551045,0.001562507,0.00009611802,0.000001938739],"category_scores_gemma":[0.0001443285,0.0001237253,0.0003809934,0.0004603485,0.0001744228,0.0007035696,0.0001320069,0.0004665881,0.000001673553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002364687,"about_ca_system_score_gemma":0.00006209483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005951328,"about_ca_topic_score_gemma":0.000005256889,"domain_scores_codex":[0.9982656,0.00006570153,0.0007448227,0.0001698465,0.0005240687,0.0002300102],"domain_scores_gemma":[0.9974744,0.0001255479,0.001104044,0.0008920212,0.0002888824,0.0001151469],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001330279,0.0002852966,0.02186386,0.0009104707,0.001414858,0.0003252754,0.005527959,0.01884508,0.03788568,0.8963251,0.0006265698,0.01585688],"study_design_scores_gemma":[0.009871125,0.002003327,0.6173887,0.01019161,0.001304911,0.02128637,0.01163198,0.1589687,0.1368592,0.02298664,0.004250376,0.003257056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7149822,0.001708322,0.2776663,0.001010337,0.003689142,0.0002169624,0.000001886127,0.00008504164,0.000639768],"genre_scores_gemma":[0.9780057,0.0000994313,0.02163947,0.00001021875,0.0002202169,0.000003906322,9.141282e-8,0.00001505465,0.0000059261],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8733384,"threshold_uncertainty_score":0.5045371,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121404865","doi":"10.1007/s13389-015-0110-5","title":"Faster 64-bit universal hashing using carry-less multiplications","year":2015,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hash function; Byte; Computer science; Carry (investment); Arithmetic; Parallel computing; Universal hashing; Bit (key); Set (abstract data type); Double hashing; Multiplication (music); Cryptographic hash function; Mathematics; Computer hardware; Computer network; Combinatorics; Computer security; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0391017793814229,"gpt":0.2465031806968069,"spread":0.207401401315384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003628225,0.000127302,0.0001890013,0.0004514769,0.00006929984,0.0001642215,0.0007016929,0.00005866021,0.000001494718],"category_scores_gemma":[0.00005096483,0.000112823,0.0001109612,0.0005515192,0.00001878089,0.001346573,0.0001830594,0.0002833156,0.000001333892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005620189,"about_ca_system_score_gemma":0.00008676997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000192625,"about_ca_topic_score_gemma":0.000001167103,"domain_scores_codex":[0.9989381,0.00002371329,0.0003243019,0.0001400587,0.00036598,0.0002077756],"domain_scores_gemma":[0.9989158,0.00005601093,0.0002064012,0.0003096819,0.0002680695,0.0002440514],"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.00003510455,0.0002396716,0.007721441,0.00008544621,0.0002998632,0.0003215937,0.004829958,0.8472896,0.07822069,0.03461881,0.0008867124,0.02545117],"study_design_scores_gemma":[0.0007856922,0.00007274232,0.002067504,0.000204481,0.00002525882,0.0003006967,0.0002566214,0.9878283,0.0005324224,0.0003915123,0.007292631,0.0002421563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1225648,0.0003572153,0.8762266,0.0001166943,0.0005990362,0.00003784159,0.000001443226,0.00004513709,0.0000511801],"genre_scores_gemma":[0.6460477,0.00001684584,0.35369,0.00002137611,0.0002076861,5.27831e-7,8.038297e-7,0.00001161849,0.000003366408],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5234829,"threshold_uncertainty_score":0.460079,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2289372344","doi":"10.1007/s13389-016-0121-x","title":"Implementation of a leakage-resilient ElGamal key encapsulation mechanism","year":2016,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":25,"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":"Engineering and Physical Sciences Research Council","keywords":"Leakage (economics); Computer science; Cryptography; Theoretical computer science; Bounded function; Exponentiation; Mathematics; Distributed computing; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.007163993448245064,"gpt":0.246449513312325,"spread":0.2392855198640799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006700595,0.000141099,0.000232202,0.0009040885,0.00004981615,0.00004478175,0.0004172531,0.00004867884,0.0000504838],"category_scores_gemma":[0.00003567083,0.0001048915,0.0002326963,0.0007616731,0.00002421823,0.0007777532,0.00006506585,0.0001055997,9.341902e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003356431,"about_ca_system_score_gemma":0.00006067575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001670904,"about_ca_topic_score_gemma":0.00001245165,"domain_scores_codex":[0.9982928,0.00003965351,0.0007799065,0.0001465942,0.0005020999,0.0002389158],"domain_scores_gemma":[0.9987553,0.0001074355,0.0004988532,0.0002403258,0.0002933073,0.0001047605],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001314091,0.00007686403,0.006776265,0.00004625908,0.0001405497,0.00001266789,0.001261761,0.0004401209,0.2994361,0.6626469,0.00007609266,0.02907326],"study_design_scores_gemma":[0.01142531,0.003026698,0.4838344,0.0008998253,0.0002622561,0.000532706,0.001715453,0.01598966,0.3751979,0.1002485,0.005332751,0.001534523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.432407,0.00007414097,0.5669565,0.0002123273,0.0002497504,0.0000678085,0.000002450679,0.00001931177,0.00001067552],"genre_scores_gemma":[0.9458243,0.0001226586,0.05394936,0.00001645247,0.00007178715,0.000004228763,5.181763e-7,0.000009690372,0.000001062629],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5623984,"threshold_uncertainty_score":0.427735,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980111226","doi":"10.1007/s13389-013-0061-7","title":"Strengthening hardware implementations of NTRUEncrypt against fault analysis attacks","year":2013,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Checksum; Implementation; Cryptosystem; Parameterized complexity; Error detection and correction; Public-key cryptography; Ciphertext; Cipher; Computer engineering; Key (lock); Cryptography; Cryptanalysis; Embedded system; Computer security; Algorithm; Encryption; Programming language; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.008622625722298683,"gpt":0.2490173941456714,"spread":0.2403947684233727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004931209,0.0002052791,0.0004621984,0.002252662,0.0001091754,0.0001747553,0.0007521677,0.0000591914,0.0001280139],"category_scores_gemma":[0.0000721936,0.0001889261,0.0006325878,0.003626375,0.00004011548,0.001028983,0.0001009213,0.0002800847,0.00000169881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002706769,"about_ca_system_score_gemma":0.00005626106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005459283,"about_ca_topic_score_gemma":0.00001952488,"domain_scores_codex":[0.9976706,0.00004717443,0.001178558,0.0001930769,0.0005652471,0.0003453536],"domain_scores_gemma":[0.9979394,0.0001974748,0.0006628346,0.0003938537,0.0006207344,0.0001857124],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.00002485516,0.000826238,0.2934915,0.0004174278,0.01302724,0.00007789003,0.01534487,0.294689,0.08583487,0.2098212,0.002985552,0.08345935],"study_design_scores_gemma":[0.004590043,0.0009050475,0.516145,0.0003724232,0.001818934,0.0001265403,0.004776546,0.4462193,0.008554019,0.007743982,0.006973415,0.001774712],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4580849,0.000177551,0.5412412,0.0001479126,0.0001566683,0.00009591329,0.000007568729,0.00003046367,0.00005783104],"genre_scores_gemma":[0.8664321,0.0001346695,0.1333097,0.00003916339,0.00005490745,0.0000104221,0.000006507077,0.00001114349,0.000001398446],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4083472,"threshold_uncertainty_score":0.7704182,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W560384006","doi":"10.1007/s13389-015-0101-6","title":"Some new results on binary polynomial multiplication","year":2015,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"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; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Multiplication (music); Mathematics; Finite field; Binary number; Multiplication algorithm; Polynomial; Logarithm; Binary operation; Field (mathematics); Algorithm; Strassen algorithm; Arithmetic; Discrete mathematics; Combinatorics; Matrix multiplication; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02165276330084879,"gpt":0.2342433627182859,"spread":0.2125905994174371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008630003,0.0001599836,0.0002088082,0.0008888774,0.00004333526,0.0001012846,0.0007531529,0.00007506309,8.270412e-7],"category_scores_gemma":[0.0002115365,0.0001430824,0.0002193456,0.0008290306,0.00002595879,0.0007262162,0.00007046801,0.0003300141,0.000007322878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003322446,"about_ca_system_score_gemma":0.00009393778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002790326,"about_ca_topic_score_gemma":1.971455e-7,"domain_scores_codex":[0.9986817,0.00003978923,0.0004709494,0.0001813144,0.0003972229,0.0002289922],"domain_scores_gemma":[0.998702,0.0001462088,0.0002684899,0.000392111,0.0001279877,0.0003631362],"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.001542666,0.0005982285,0.0007418733,0.00005399159,0.0004028644,0.0002457787,0.003708559,0.1711419,0.04662907,0.6710266,0.05022459,0.05368378],"study_design_scores_gemma":[0.03439883,0.01579838,0.04556693,0.001874915,0.0002719764,0.001673613,0.0003410783,0.1779082,0.03434215,0.1896261,0.4939566,0.004241285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2770482,0.001702215,0.7126157,0.004068173,0.00357377,0.0001657378,0.000002855612,0.0003204464,0.0005029595],"genre_scores_gemma":[0.9497874,0.00006897144,0.04886828,0.0001709309,0.001073749,0.000001509769,5.860639e-7,0.00001537101,0.00001322193],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6727392,"threshold_uncertainty_score":0.5834733,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3108917887","doi":"10.1007/s13389-020-00245-4","title":"x-only point addition formula and faster compressed SIKE","year":2020,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Royal Bank of Canada","keywords":"Point (geometry); Mathematics; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.00704499768570218,"gpt":0.1827192526199425,"spread":0.1756742549342403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001862428,0.0001500459,0.0002460412,0.0003634024,0.00005489247,0.0001409935,0.000378587,0.00006001327,0.00001037673],"category_scores_gemma":[0.00004608364,0.0001269971,0.000186139,0.0006304919,0.00003209714,0.0006768398,0.00008960983,0.0003130333,0.000001337288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005689568,"about_ca_system_score_gemma":0.00002282636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.802704e-7,"about_ca_topic_score_gemma":4.450958e-7,"domain_scores_codex":[0.9989455,0.000022992,0.0003824438,0.0001544101,0.0002871063,0.0002075573],"domain_scores_gemma":[0.9992257,0.0001026609,0.00017146,0.0001432617,0.0001069432,0.0002500011],"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.0003870193,0.0007396779,0.02043614,0.002074391,0.002174456,0.001714035,0.0176014,0.07444406,0.2904088,0.4053774,0.007929397,0.1767132],"study_design_scores_gemma":[0.008594677,0.003519211,0.1765532,0.001384228,0.0003058539,0.003727359,0.0004889081,0.7244713,0.01401393,0.01504453,0.04966033,0.002236446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1206729,0.0009863812,0.87617,0.001702315,0.00023186,0.00007118893,0.000001936969,0.00006756774,0.00009582413],"genre_scores_gemma":[0.9373385,0.0001642193,0.06201223,0.0003020015,0.0001694084,0.000001220889,4.857526e-7,0.00001134013,6.536384e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8166656,"threshold_uncertainty_score":0.5178791,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2413472586","doi":"10.1007/s13389-016-0133-6","title":"An overview of hardware-level statistical power analysis attack countermeasures","year":2016,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Side channel attack; Power analysis; Computer science; Cryptography; Computer security; Encryption; Countermeasure; Variety (cybernetics); Hardware security module; Overhead (engineering); Embedded system; Artificial intelligence; Engineering; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.06317022046290896,"gpt":0.3366096217778632,"spread":0.2734394013149543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008534481,0.0001682078,0.0004513989,0.00126503,0.00004512741,0.00007975126,0.0007037171,0.00005533894,0.0001118451],"category_scores_gemma":[0.00008894761,0.000117775,0.0003795227,0.001634559,0.00006071911,0.0007356736,0.00005063642,0.0001390987,8.682372e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002407321,"about_ca_system_score_gemma":0.00006147164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007833631,"about_ca_topic_score_gemma":0.00001550572,"domain_scores_codex":[0.9980509,0.0000665383,0.0007818358,0.0001869689,0.0006485027,0.0002652131],"domain_scores_gemma":[0.9983212,0.0002176257,0.000367608,0.0004326898,0.0004631963,0.000197733],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000118108,0.001087265,0.1385221,0.0003287543,0.006357678,0.0002047321,0.002707105,0.01177376,0.05855668,0.7456877,0.001558468,0.03309762],"study_design_scores_gemma":[0.002315918,0.001205313,0.9588713,0.0004201119,0.000766059,0.0001489834,0.0001330626,0.02293772,0.001633378,0.003817661,0.006988536,0.0007619371],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1958163,0.0006031407,0.8031592,0.0001089691,0.0001942199,0.00004295728,0.0000397236,0.00002251771,0.00001299303],"genre_scores_gemma":[0.9211503,0.0003912947,0.07837729,0.00003076102,0.00003667597,0.000001808348,0.000001205453,0.000009789291,8.782449e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8203492,"threshold_uncertainty_score":0.4802724,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964201351","doi":"10.1007/s13389-011-0008-9","title":"SPA-resistant binary exponentiation with optimal execution time","year":2011,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"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":"Exponentiation; Modular exponentiation; Cryptosystem; Computer science; Power analysis; Overhead (engineering); Binary number; Cryptography; Side channel attack; Algorithm; Parallel computing; Theoretical computer science; Public-key cryptography; Arithmetic; Mathematics; Encryption; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.0106181311011038,"gpt":0.1922593929576475,"spread":0.1816412618565437,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000428931,0.0001526528,0.0001960103,0.0008197234,0.00008433623,0.00007802799,0.0004010184,0.00004777847,0.00004856939],"category_scores_gemma":[0.00001331521,0.0001271672,0.0001498233,0.0009383777,0.0000291199,0.0009347025,0.00004775841,0.0001977247,0.000002789481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002399364,"about_ca_system_score_gemma":0.00004395484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001146545,"about_ca_topic_score_gemma":0.000001716025,"domain_scores_codex":[0.9987646,0.0000288676,0.0004371059,0.0001482245,0.0003819406,0.00023931],"domain_scores_gemma":[0.9991113,0.00003427904,0.0002910715,0.0002326399,0.00020812,0.000122618],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000956053,0.001778025,0.01282069,0.0003110901,0.001687087,0.001225176,0.01813991,0.03121814,0.3715053,0.5470077,0.001245358,0.01210552],"study_design_scores_gemma":[0.01010076,0.01076412,0.5429198,0.00132965,0.0006202591,0.002646953,0.001243157,0.3737925,0.0341756,0.01040533,0.008772899,0.003228947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4114038,0.000147518,0.5880858,0.00003892941,0.0001366419,0.0000567981,8.39718e-7,0.00004483136,0.00008487595],"genre_scores_gemma":[0.7957546,0.00004526547,0.2041187,0.00001392698,0.00005080169,0.00000325952,0.000001222404,0.00001054515,0.000001763432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5366024,"threshold_uncertainty_score":0.5185727,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070532428","doi":"10.1007/s13389-011-0003-1","title":"Algorithm-level error detection for Montgomery ladder-based ECSM","year":2011,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Correctness; Scalar multiplication; Computer science; Elliptic curve cryptography; Cryptography; Algorithm; Elliptic curve; Fault detection and isolation; Computation; Arithmetic; Mathematics; Public-key cryptography; Computer security; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03866171637910226,"gpt":0.2225906132771978,"spread":0.1839288968980955,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005464149,0.0002062572,0.0002898468,0.001179319,0.0001029259,0.00006824594,0.0006285671,0.0001171564,0.000006811396],"category_scores_gemma":[0.00007878576,0.0001817252,0.0005061791,0.0009790619,0.00003746064,0.0005029674,0.0000369081,0.000302821,0.000001103342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001918594,"about_ca_system_score_gemma":0.00005350172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009860328,"about_ca_topic_score_gemma":0.000005573062,"domain_scores_codex":[0.9985949,0.0000258581,0.0005131621,0.0001990221,0.0003176485,0.0003494396],"domain_scores_gemma":[0.9988053,0.0001666996,0.0002801311,0.0002913385,0.0002730986,0.0001834512],"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.0002953055,0.001404429,0.003554343,0.0006791812,0.001594356,0.0003760886,0.003178543,0.02863225,0.0695676,0.02437938,0.0003521702,0.8659863],"study_design_scores_gemma":[0.005793058,0.004459054,0.119529,0.0008546164,0.0003829038,0.0008217967,0.0002221211,0.7314723,0.1084573,0.01951018,0.006549205,0.001948414],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02219768,0.0006318953,0.9757245,0.00005806032,0.001113985,0.0001410345,0.000003357268,0.00009299495,0.00003646627],"genre_scores_gemma":[0.5286539,0.00002072341,0.4711355,0.00003512219,0.0001253549,0.00001076215,2.205219e-7,0.00001650339,0.000001921919],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8640379,"threshold_uncertainty_score":0.7410538,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3213153633","doi":"10.1007/s13389-022-00287-w","title":"Rethinking modular multi-exponentiation in real-world applications","year":2022,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Modular exponentiation; Exponentiation; Computer science; Cryptography; Parallel computing; Side channel attack; Theoretical computer science; Arithmetic; Algorithm; Public-key cryptography; Mathematics; Encryption; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01440961944567292,"gpt":0.2351199308294662,"spread":0.2207103113837932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009348762,0.0001183928,0.0002008604,0.002065793,0.0001550843,0.00006708336,0.0007210216,0.00003131668,0.000008662851],"category_scores_gemma":[0.00001844921,0.0001241499,0.0001973613,0.002912379,0.00001648714,0.0003876119,0.0001631998,0.0006042719,4.768815e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006662786,"about_ca_system_score_gemma":0.00004179265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000263051,"about_ca_topic_score_gemma":0.00002427111,"domain_scores_codex":[0.9985604,0.00006938226,0.0005220166,0.0001718176,0.0004506899,0.00022569],"domain_scores_gemma":[0.9992096,0.00009357696,0.0002582597,0.0002826718,0.00007641735,0.00007943282],"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.00001589928,0.0004772241,0.02552634,0.00008680207,0.0001402741,0.0001573991,0.002997428,0.7580715,0.02435538,0.1779786,0.00004313236,0.01015005],"study_design_scores_gemma":[0.002752685,0.0003087809,0.3370537,0.0002020434,0.00006399683,0.0003493421,0.0002854299,0.6122245,0.001376363,0.03297296,0.01157699,0.0008332483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1242536,0.0008054635,0.8740714,0.0002314597,0.0003670649,0.0001437634,8.121405e-7,0.0000648203,0.00006167652],"genre_scores_gemma":[0.8653351,0.0001627806,0.1343546,0.00003373552,0.00006198065,0.00003462194,8.279047e-7,0.0000119073,0.000004401547],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7410815,"threshold_uncertainty_score":0.5062685,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070626323","doi":"10.1007/s13389-012-0035-1","title":"Sequential multiplier with sub-linear gate complexity","year":2012,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplier (economics); Finite field; Mathematics; Binary number; Arithmetic; Time complexity; Computational complexity theory; Algorithm; Computer science; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02097325956383962,"gpt":0.2258844092521239,"spread":0.2049111496882843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008533054,0.000202513,0.0002791878,0.0005675593,0.00009125345,0.00007567294,0.0006111563,0.00006210633,0.00001217868],"category_scores_gemma":[0.0000292254,0.0001599953,0.0002479939,0.0009085835,0.00007962462,0.0009964181,0.00008733954,0.0004075098,0.000004233443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001855401,"about_ca_system_score_gemma":0.0000278877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001418324,"about_ca_topic_score_gemma":7.693916e-7,"domain_scores_codex":[0.9985893,0.00005037007,0.0003802113,0.0001316552,0.0004030143,0.0004454489],"domain_scores_gemma":[0.998916,0.00009455064,0.0002361429,0.0003079641,0.0001568319,0.000288536],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0003000722,0.0006800094,0.04209633,0.0002100083,0.00101671,0.0001757619,0.002775786,0.03559173,0.07962363,0.8283235,0.0002118526,0.008994572],"study_design_scores_gemma":[0.0179555,0.005407133,0.414838,0.002757906,0.001031954,0.01170683,0.0005248088,0.2696676,0.1446602,0.04723389,0.07691675,0.0072994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4009804,0.0003468492,0.5978943,0.000067112,0.0005017659,0.00004320816,6.139459e-7,0.00007095054,0.00009482422],"genre_scores_gemma":[0.8701624,0.00003282848,0.1293841,0.00004449311,0.0003561206,0.000001895513,3.172429e-7,0.00001656915,0.000001335539],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7810897,"threshold_uncertainty_score":0.6524419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2806079250","doi":"10.1007/s13389-018-0197-6","title":"A new class of irreducible pentanomials for polynomial-based multipliers in binary fields","year":2018,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"H2020 Marie Skłodowska-Curie Actions; European Commission","keywords":"Multiplier (economics); Modulo; Finite field; Binary number; Class (philosophy); Trinomial; Boolean function","retraction":null,"screen_n_in":null,"score":{"opus":0.009644395364798096,"gpt":0.2390027257456447,"spread":0.2293583303808466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005689121,0.0001567307,0.0003616774,0.001441026,0.00003990363,0.00004616642,0.0006483857,0.0001153406,0.0000078698],"category_scores_gemma":[0.0001009064,0.0001430314,0.0003514735,0.001161249,0.00005612199,0.0002952473,0.00004719677,0.0002140946,4.328195e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002281984,"about_ca_system_score_gemma":0.0001876276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002475728,"about_ca_topic_score_gemma":0.00002061643,"domain_scores_codex":[0.9986306,0.00002454506,0.0006390123,0.0001782136,0.0002341766,0.0002934747],"domain_scores_gemma":[0.9988369,0.0002737856,0.0002958179,0.0002861969,0.0001530707,0.0001541661],"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.001602276,0.001367691,0.04666242,0.001260866,0.001045858,0.0002110507,0.006098601,0.2539329,0.5729558,0.03448804,0.01406157,0.06631294],"study_design_scores_gemma":[0.02400495,0.009275748,0.1564992,0.003223379,0.0002769888,0.0003004141,0.0004018678,0.4814132,0.2942815,0.007705373,0.02037363,0.002243798],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.296672,0.0005265203,0.7012393,0.0004775038,0.0008656168,0.0001467263,0.000001128498,0.00002169231,0.0000495312],"genre_scores_gemma":[0.7912316,0.00002557437,0.2084751,0.0000385417,0.0002113514,0.000003333405,2.094012e-7,0.00001111987,0.000003089066],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4945597,"threshold_uncertainty_score":0.5832651,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003555324","doi":"10.1007/s13389-011-0013-z","title":"High performance GHASH and impacts of a class of unconventional bases","year":2011,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Element (criminal law); Function (biology); Field (mathematics); Discrete mathematics; Mathematics; Polynomial; Block cipher; Multiplication (music); String (physics); Set (abstract data type); Class (philosophy); Finite field; Binary number; Arithmetic; Computer science; Combinatorics; Algorithm; Cryptography; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01403674815502639,"gpt":0.215526916183141,"spread":0.2014901680281146,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004419499,0.0001021094,0.0002450412,0.0006379595,0.00002855352,0.00001542418,0.0002763349,0.00003583124,0.00002397307],"category_scores_gemma":[0.00003003947,0.00009012477,0.0001325839,0.000606954,0.00005960804,0.0004839093,0.00005689328,0.0001327422,9.209197e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006528778,"about_ca_system_score_gemma":0.00004727752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002671872,"about_ca_topic_score_gemma":0.000003958,"domain_scores_codex":[0.9989042,0.00001717755,0.0005631555,0.00008532059,0.0002824489,0.0001476919],"domain_scores_gemma":[0.9990633,0.000068538,0.0003945299,0.0001505892,0.0002340316,0.00008901562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001169716,0.0006012105,0.2717495,0.0008650831,0.0006772281,0.00003311368,0.00447944,0.001382066,0.04456713,0.662415,0.0001092737,0.01300391],"study_design_scores_gemma":[0.001937927,0.001335681,0.9421248,0.0005386046,0.00008344527,0.000266829,0.0001848537,0.01592437,0.03162705,0.005399825,0.0002675649,0.0003090505],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8631667,0.0002706377,0.1362697,0.00002569717,0.0001863406,0.00003998534,0.000003111485,0.000009059435,0.00002872517],"genre_scores_gemma":[0.9352371,0.0002983802,0.06442289,0.000009298815,0.00002542747,0.000001017507,3.775772e-7,0.000005254254,3.229098e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6703753,"threshold_uncertainty_score":0.3675182,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385422577","doi":"10.1007/s13389-023-00329-x","title":"Probabilistic root finding in code-based cryptography","year":2023,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"McEliece cryptosystem; Probabilistic logic; Cryptosystem; Computer science; Cryptography; Timing attack; Algorithm; Theoretical computer science; Finite field; Code (set theory); Side channel attack; Mathematics; Discrete mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01920748407871984,"gpt":0.2681746827172897,"spread":0.2489671986385699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001473478,0.0002206836,0.000372979,0.004055928,0.00008765089,0.0001696979,0.0008019366,0.00008724595,0.00001283457],"category_scores_gemma":[0.0001526096,0.0002120846,0.0003568787,0.00688521,0.00004259432,0.0005564847,0.0000624024,0.0004572939,0.000003747387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003761531,"about_ca_system_score_gemma":0.0001004898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008671461,"about_ca_topic_score_gemma":0.00004870926,"domain_scores_codex":[0.9977121,0.00005866668,0.0008916226,0.0002450488,0.0005833642,0.0005091641],"domain_scores_gemma":[0.9986383,0.0003571217,0.0003018521,0.0003471282,0.0001809144,0.0001747105],"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.00005026633,0.000428396,0.08562416,0.000408381,0.0002194514,0.0006198966,0.002162875,0.3085118,0.006465896,0.5861375,0.0009093087,0.008462067],"study_design_scores_gemma":[0.004160882,0.0006871506,0.4254881,0.0007142426,0.00005683249,0.0001276592,0.0002121859,0.5159827,0.0008351434,0.04402645,0.006679244,0.001029384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4902332,0.000188074,0.5084115,0.000379663,0.0004735762,0.0001328894,0.000002879025,0.0001411513,0.00003716562],"genre_scores_gemma":[0.9682087,0.00006837444,0.03156616,0.00004241263,0.00007387951,0.00001677163,0.000002458613,0.00002070071,5.677852e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5421111,"threshold_uncertainty_score":0.8648559,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3100957129","doi":"10.1007/s13389-020-00250-7","title":"Removable weak keys for discrete logarithm-based cryptography","year":2020,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Electronics and Information technology","keywords":"Public-key cryptography; Cryptosystem; Cryptography; Discrete logarithm; Prime (order theory); Key (lock); Security parameter; Elliptic curve cryptography; Set (abstract data type)","retraction":null,"screen_n_in":null,"score":{"opus":0.01328726569163282,"gpt":0.2186007287197764,"spread":0.2053134630281435,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006682667,0.0003252161,0.0005254652,0.0008270681,0.0001307339,0.0002631424,0.001415444,0.0001380109,0.00001315777],"category_scores_gemma":[0.0002397323,0.000299959,0.0007933617,0.002677452,0.00006503729,0.001021126,0.00008901729,0.0005121084,0.000002091091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001405078,"about_ca_system_score_gemma":0.00009636386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002635638,"about_ca_topic_score_gemma":0.000001149083,"domain_scores_codex":[0.9977278,0.00004270163,0.0007949751,0.0003701035,0.0005451131,0.0005193431],"domain_scores_gemma":[0.9979027,0.0003018205,0.0004176232,0.0004561715,0.0004214938,0.0005001901],"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.0003088531,0.0002695831,0.002324585,0.000593802,0.0005939282,0.0001216739,0.0008215536,0.03317335,0.02032711,0.9266008,0.007673176,0.007191649],"study_design_scores_gemma":[0.007941742,0.003227484,0.005226484,0.0006362833,0.0002895879,0.0001904993,0.0001640913,0.6103274,0.01129642,0.03495122,0.3236733,0.002075473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004823759,0.001224803,0.9905936,0.002190583,0.0006075505,0.0002196176,0.00002191633,0.000184734,0.0001334453],"genre_scores_gemma":[0.3309938,0.0001592361,0.6677504,0.000593025,0.0004490794,0.00001232161,0.000006080712,0.00003572113,3.006756e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8916495,"threshold_uncertainty_score":0.9999452,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4409238752","doi":"10.1007/s13389-025-00373-9","title":"Evaluation of encrypted matching criteria using homomorphic encryption based FSM","year":2025,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphic encryption; Encryption; Computer science; Matching (statistics); Theoretical computer science; Cryptography; Algorithm; Mathematics; Computer security; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02479788088699228,"gpt":0.2977358301225645,"spread":0.2729379492355722,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00426132,0.0002148246,0.0004022912,0.002024797,0.00009166403,0.0001282476,0.0007471803,0.0001233751,0.00002244917],"category_scores_gemma":[0.0003586203,0.0002142006,0.0003029367,0.00276706,0.00004858975,0.001012389,0.00009649135,0.0003630673,4.3542e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007799004,"about_ca_system_score_gemma":0.0003609564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001954725,"about_ca_topic_score_gemma":0.000002974313,"domain_scores_codex":[0.9972966,0.0002166395,0.0008963846,0.0002239098,0.001100611,0.0002658021],"domain_scores_gemma":[0.9972814,0.000195137,0.0005207069,0.0004674318,0.001435608,0.0000996625],"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.00008023968,0.0004755332,0.002846281,0.0006077365,0.0006244508,0.00003428326,0.001052488,0.2261959,0.5660831,0.1847158,0.0001573069,0.01712683],"study_design_scores_gemma":[0.001757464,0.0001340763,0.01412054,0.001099696,0.0003800886,0.00005660829,0.0000718317,0.9363169,0.01152736,0.0339975,0.0002263806,0.0003115605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3574691,0.0009167304,0.6406599,0.00006433063,0.000684792,0.0001032504,0.000002684546,0.00005059844,0.00004858309],"genre_scores_gemma":[0.8220274,0.00004173529,0.1778183,0.00003321017,0.00006329223,0.000003117126,0.000001304668,0.00001150101,7.640718e-8],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.710121,"threshold_uncertainty_score":0.8734845,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}