Bibliographic record
Abstract
In this thesis, we introduce several new algorithms and concepts within the topic of post-quantum cryptography.The security of Hamming weight code-based cryptography is largely based on the effectiveness of information set decoding (ISD) attacks.We introduce a modification to Stern's algorithm that reduces average decryption time by approximately 14% for a code of length 1024, dimension 524 capable of correcting 50 errors.We accomplish this by adding 3 extra columns to the columns reduced to the identity matrix and performing extra row reductions that manipulate the matrix into a form that still allows Stern's algorithm to be run.We introduce a new problem that cryptosystems can be based on, which uses a permutation of vector components to obfuscate ciphertexts.This thesis further introduces a new type of cryptosystem that uses this idea of vector component permutation to obfuscate plaintexts.The system appears resistant to improvements to lattice reduction algorithms and has key sizes that are usable for practical applications.We give a variation of the LWE problem that allows the modulus to be obfuscated.We give a decryption algorithm based on this obfuscated basis LWE and apply it to standard LWE decryption.We show this application and all immediate derivations give no advantages with regard to decryption failure rates of LWE systems.Finally, we show a connection between Module-LWE and Integer Ring-LWE systems and describe an attack that somewhat connects the security of the two systems.16 return {b 1 , b 2 , . . ., b n } 17 k := k + 1 18 go to line 10 // Lines 19-31 swap basis vectors b k and b k-1 to prevent significantly smaller b k from following b k-1 .These lines also update the relevant B i and i,j values.19B 22 B k := B k-1 B k /B 23 B k-1 := B 24 swap b k-1 and b k 14 25 for j between 1 and k -2: 26 swap k-1,j and k,j 27 for i between k + 1 and n:28
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
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".