MétaCan
Menu
Back to cohort
Record W2354564907

Code Obfuscation Algorithm to Resist Static Disassembly

2015· article· en· W2354564907 on OpenAlexaff
Yang Yu-b

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicManufacturing Process and Optimization
Canadian institutionsCybernet Systems Corporation (Canada)
Fundersnot available
KeywordsObfuscationJumpAlgorithmComputer scienceReuseCode (set theory)Function (biology)Static analysisSoftwareResistEngineeringComputer securityProgramming language
DOInot available

Abstract

fetched live from OpenAlex

Code obfuscation was employed to prevent the software reverse analysis and protect the important information effectively by strengthening the restore difficult.bf(branch function)algorithm is obfuscation algorithm effective for the static disassembly,but the bf jump is a constant address,so it is easy to be restored.The proposed algorithm based on the bf algorithm improved the defect and enhanced the confusing complexity for the static disassembly,reusing the junk instruction to relocate the bf function jump address and hide the second jump address.In the experiment,the test samples were obfuscated by bf algorithm and the proposed algorithm separately and the static disassembly tool IDA Pro was used for testing,the experimental results show that the new algorithm has significantly improvement in performance and security.

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.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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.866
Threshold uncertainty score0.239

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.000
Open science0.0000.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.020
GPT teacher head0.239
Teacher spread0.219 · 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.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicManufacturing Process and OptimizationFrench-language works237,207