检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

110 册 图书
2 篇 会议

馆藏范围

112 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2 篇 工学
- 2 篇 计算机科学与技术...
1 篇 理学
- 1 篇 物理学

主题

112 篇 stack pointer
49 篇 address
45 篇 stack
43 篇 data
37 篇 interrupt
30 篇 program
28 篇 instruction
26 篇 mov
23 篇 byte
21 篇 memory
18 篇 pdp11
18 篇 input
18 篇 program counter
17 篇 motorola
16 篇 listings
16 篇 port
14 篇 user
14 篇 manual
14 篇 pointer
14 篇 mode

机构

1 篇 univ dayton dept...
1 篇 riverside res 26...
1 篇 univ paris dider...
1 篇 univ paris 13 cn...

作者

1 篇 m. w mcmurran
1 篇 pommellet adrien
1 篇 diaz marcio
1 篇 baldwin rusty o.
1 篇 riley ronald a.
1 篇 ramesh s gaonkar
1 篇 heiner martin
1 篇 touili tayssir
1 篇 graham james t.
1 篇 hubert s howe
1 篇 fisher ashwin

语言

111 篇 英文
1 篇 德文

检索条件"主题词=stack pointer"

共 112 条记录，以下是1-10 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Register Hamming distance from side channels

引用

Conference on Cyber Sensing

作者： Riley, Ronald A. Graham, James T. Baldwin, Rusty O. Fisher, Ashwin Riverside Res 2640 Hibiscus Way Beavercreek OH 45431 USA Univ Dayton Dept Comp Sci 300 Coll Pk Dayton OH 45469 USA

ISBN: (数字)9781510617728

ISBN: (纸本)9781510617728

We applied machine learning to detect changes in state of key registers in digital devices from their analog RF emissions. As digital devices operate, they emit information via analog side channels. We collected the RF side channel with a 500-MHz shielded loop probe from Riscure, placed in the nearfield (< 1mm) of the device under test (DuT). We investigated a number of Internet-of-Thing (IoT) DuTs including Arduino Uno and PIC24 processors. Conventional processors implement instructions as a sequence of subtasks. The first subtasks include incrementing the program counter (PC) register and fetching the next instruction from program memory to the instruction register (IR). These two subtasks occur almost every instruction cycle. We ran programs on the DuT and collected the RF emissions. We parsed the object code of the programs to determine the state of key registers including the PC and IR during each instruction cycle and observed that the RF signal of each cycle is strongly correlated with the Hamming Distance (HD) (i.e., the number of bits changing) in the PC and IR registers. Based on this result, we developed classifiers to extract the HD of the PC, IR, as well as the stack pointer (SP). The classification results vary with true HD as some values are rare and have few examples in the training set. The classification accuracy exceeds 99% for the PC and the IR. Due to the relatively few HD in the training set for the SP, its results slightly exceeded 97%.

关键词： Side-Channel Analysis Machine Learning Reverse Engineering Hamming Distance Internet of Things Internet of Everything Program Counter Instruction Register stack pointer Arduino Uno ATmega328P

来源：评论

学校读者我要写书评

暂无评论

Reachability Analysis of Pushdown Systems with an Upper stack 11th

Reachability Analysis of Pushdown Systems with an Upper Stac...

引用

11th International Conference on Language and Automata Theory and Applications (LATA)

作者： Pommellet, Adrien Diaz, Marcio Touili, Tayssir Univ Paris Diderot LIPN Paris France Univ Paris 13 CNRS LIPN Villetaneuse France

ISBN: (纸本)9783319537320;9783319537337

Pushdown systems (PDSs) are a natural model for sequential programs, but they can fail to accurately represent the way an assembly stack actually operates. Indeed, one may want to access the part of the memory that is below the current stack or base pointer, hence the need for a model that keeps track of this part of the memory. To this end, we introduce pushdown systems with an upper stack (UPDSs), an extension of PDSs where symbols popped from the stack are not destroyed but instead remain just above its top, and may be overwritten by later push rules. We prove that the sets of successors post* and predecessors pre* of a regular set of configurations of such a system are not always regular, but that post* is context-sensitive, so that we can decide whether a single configuration is forward reachable or not. In order to underapproximate pre* in a regular fashion, we consider a bounded-phase analysis of UPDSs, where a phase is a part of a run during which either push or pop rules are forbidden. We then present a method to overapproximate post* that relies on regular abstractions of runs of UPDSs. Finally, we show how these approximations can be used to detect stack overflows and stack pointer manipulations with malicious intent.

关键词： Pushdown systems Reachability analysis stack pointer Finite automata

来源：评论

学校读者我要写书评

暂无评论

Motorola :: 6801 :: MC6801Rm Ad2 MC6801 Reference Manual May84