MétaCan
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
Sort
Language
Type
Field
Venue
Journal of Mathematical Cryptology
Topic
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

43 results · 1 filter active ·
Results by year
20072024
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
43 works in the cohort · of 4,299,418page 1 of 1

Labels cover 0 of 43 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 43 of 43 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affunlabeled
Another look at HMQV
Alfred Menezes
2007· article· en· Journal of Mathematical Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
89
citations
affunlabeled
On the security of multi-prime RSA
M. Jason Hinek
2008· article· en· Journal of Mathematical Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
42
citations
affunlabeled
Another look at HMAC
Neal Koblitz, Alfred Menezes
2013· article· en· Journal of Mathematical Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affunlabeled
Improved security analysis of PMAC
Mridul Nandi, Avradip Mandal
2008· article· en· Journal of Mathematical Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affunlabeled
One-round secure comparison of integers
Blake Ian F., Kolesnikov Vladimir
2009· article· en· Journal of Mathematical Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
afffundunlabeled
New Techniques for SIDH-based NIKE
David Urbanik, David Jao
2020· article· en· Journal of Mathematical Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affunlabeled
Cryptanalysis of “MAKE”
Daniel R. L. Brown, Neal Koblitz, Jason T. LeGrow
2022· article· en· Journal of Mathematical Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
afffundunlabeled
On the asymptotic effectiveness of Weil descent attacks
Koray Karabina, Alfred Menezes, Carl Pomerance, Igor E. Shparlinski
2010· article· en· Journal of Mathematical Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
Statistical distribution and collisions of VSH
Blake Ian F., Igor E. Shparlinski
2007· article· en· Journal of Mathematical Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Compact elliptic curve representations
Mathieu Ciet, Jean-Jacques Quisquater, Francesco Sica
2011· article· en· Journal of Mathematical Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
On the density of some special primes
John Friedlander, Igor E. Shparlinski
2009· article· en· Journal of Mathematical Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Plactic key agreement (insecure?)
Daniel R. L. Brown
2023· article· en· Journal of Mathematical Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Is extracting data the same as possessing data?
Douglas R. Stinson, Jalaj Upadhyay
2014· article· en· Journal of Mathematical Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Multi-prover proof of retrievability
Maura B. Paterson, Douglas R. Stinson, Jalaj Upadhyay
2018· preprint· en· Journal of Mathematical Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
The dihedral hidden subgroup problem
Imin Chen, David Sun
2024· article· en· Journal of Mathematical Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
A code-based hybrid signcryption scheme
Jean Belo Klamti, M. Anwar Hasan
2023· preprint· en· Journal of Mathematical Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About