MétaCan
Menu
Back to cohort
Record W4415257998 · doi:10.61091/jcmcc127-22

Diffie-Hellman key exchange on the Heisenberg group

2025· article· W4415257998 on OpenAlexvenueno aff
Elahe Mehraban, T. Aaron Gulliver, Reza Ebrahimi Atani, Evren Hınçal

Bibliographic record

VenueJournal of Combinatorial Mathematics and Combinatorial Computing · 2025
Typearticle
Language
FieldBiochemistry, Genetics and Molecular Biology
TopicDNA and Biological Computing
Canadian institutionsnot available
Fundersnot available
KeywordsKey exchangeCryptographyFibonacci numberSequence (biology)Parameterized complexitySimple (philosophy)Key (lock)

Abstract

fetched live from OpenAlex

This paper introduces Hadamard-type t-Fibonacci-Lehmer (HTFL) sequences, a new hybrid construction combining Lehmer and Fibonacci recurrences. We establish their fundamental properties, including simple periodicity, and extend the definition to finite groups, with a detailed study of the Heisenberg group. Building on these results, we propose two Diffie–Hellman-style key exchange protocols based on upper-triangular unipotent matrices parameterized by HTFL sequence terms. Our work thus connects sequence theory, group theory, and cryptography in a novel way. While the algebraic framework and periodicity analysis are rigorous, we present the cryptographic constructions primarily as a conceptual foundation. We also discuss potential security considerations and outline directions for strengthening these schemes under formal hardness assumptions. This study demonstrates that HTFL sequences provide a fertile ground for both combinatorial investigations and future cryptographic applications.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.218
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.002
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0010.000
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.014
GPT teacher head0.251
Teacher spread0.238 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Combinatorial Mathematics and Combinatorial ComputingSame topicDNA and Biological ComputingFrench-language works237,207