MétaCan
Menu
Back to cohort
Record W2157658011 · doi:10.1109/wac.2006.375755

Improving the Secure Socket Layer Protocol by modifying its Authentication function

2006· article· en· W2157658011 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Authentication Protocols Security
Canadian institutionsConcordia University
Fundersnot available
KeywordsComputer scienceTransport Layer SecurityCryptographyComputer networkCryptographic protocolCryptographic primitiveMessage authentication codeAuthentication (law)Hash-based message authentication codeEncryptionKey (lock)Computer security

Abstract

fetched live from OpenAlex

Secure Socket Layer (SSL) is a cryptographic protocol widely used to make a secure connection to a Web server. SSL uses three interdependent cryptographic functions to perform a secure connection. The first function is authentication. It is used to allow the client to identify the server and optionally allow the server to identify the client. The most common cryptographic algorithm used for this function is RSA. If we double the key length in RSA to have more secure communication, then it is known that the time needed for the encryption and decryption will be increased approximately eight times. In this paper, we propose a modification of RSA from the domain of integers to the domain of Gaussian arithmetic to be applied to the first function of SSL that would give more secure communication. This modification would use only double the time needed for the usual implementation of RSA with key size of 1024 bits.

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.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.878
Threshold uncertainty score0.491

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
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.016
GPT teacher head0.272
Teacher spread0.256 · 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