The Terminator to Android Hardening Services
Outline
Background
DexHunter
Analysis of major products
Related work
Dex File
Java source code -> Java class -> dex
Java class: each file contains one class
dex: one file contains all classes
Reorganize constant pools in each class file into shared and type-specific constant pools
...
slides of
An Examination of Bloom Filters and their Applications
Author: Jacob Honoro
Outline
Bloom Filter Overview
Traditional Applications
Hierarchical Bloom Filters Paper
Less Traditional Applications & Extensions
Abstract—Deep learning is a branch of artificial intelligence
employing deep neural network architectures that has significantly
advanced the state-of-the-art in computer vision, speech
recognition, natural language processing and other domains. In
November 2015, Google released TensorFlow, an open source deep
learning software library for defining, training and deploying
machine learning models. In this paper, we review TensorFlow
and put it in context of modern deep learning concepts and
software. We discuss its basic computational paradigms and
distributed execution model, its programming interface as well
as accompanying visualization toolkits. We then compare TensorFlow
to alternative libraries such as Theano, Torch or Caffe
on a qualitative as well as quantitative basis and finally comment
on observed use-cases of TensorFlow in academia and industry.
Getting started with RxSwift and RxCocoa
It’s great when code does exactly what you tell it to (unlike my cat). Change something in
the program, tell the code to update, and it does. Good code!
Most programming in the Object-Oriented era has been imperative like that: Your code
tells your program what to do and has many ways to listen to changes—but you generally
must actively tell the system when something changes.
That’s fine as far as it goes, but wouldn’t it be even better if you could set things up so that
when something in your app changes, the code updates automatically? That’s the basic
idea of reactive programming: your application can react to changes in the underlying data
without you telling it to do so directly. This makes it easier to focus on the logic at hand
rather than maintaining a particular state.
HC-256 is a software-efficient stream cipher. It generates
keystream from a 256-bit secret key and a 256-bit initialization vector.
The encryption speed of the C implementation of HC-256 is about 1.9
bits per clock cycle (4.2 cycle/byte) on the Intel Pentium 4 processor. A
variant of HC-256 is also introduced in this paper.
缓冲区溢出的经典之作。
Introduction
Over the last few months there has been a large increase of buffer overflow vulnerabilities being both
discovered and exploited. Examples of these are syslog, splitvt, sendmail 8.7.5, Linux/FreeBSD mount, Xt
library, at, etc. This paper attempts to explain what buffer overflows are, and how their exploits work. Basic
knowledge of assembly is required. An understanding of virtual memory concepts, and experience with gdb are
very helpful but not necessary. We also assume we are working with an Intel x86 CPU, and that the operating
system is Linux. Some basic definitions before we begin: A buffer is simply a contiguous block of computer
memory that holds multiple instances of the same data type. C programmers normally associate with the word
buffer arrays. Most commonly, character arrays. Arrays, like all variables in C, can be declared either static or
dynamic. Static variables are allocated at load time on the data segment. Dynamic variables are allocated at run
time on the stack. To overflow is to flow, or fill over the top, brims, or bounds. We will concern ourselves only
with the overflow of dynamic buffers, otherwise known as stackbased
buffer overflows.
A COMPACT GUIDE TO LEX & YACC<br><br>by Tom Niemann<br><br>Contents<br>Contents.............2<br>Preface.............3<br>Introduction............4<br>Lex..............6<br>Theory.............6<br>Practice............7<br>Yacc.............12<br>Theory............12<br>Practice, Part I...........13<br>Practice, Part II...........16<br>Calculator.............19<br>Description............19<br>Include File............22<br>Lex Input.............23<br>Yacc Input...........24<br>Interpreter............27<br>Compiler...........28<br>Graph............30<br>More Lex............34<br>Strings............34<br>Reserved Words..........35<br>Debugging Lex...........35<br>More Yacc............36<br>Recursion............36<br>If-Else Ambiguity............36<br>Error Messages...........37<br>Inherited Attributes..........38<br>Embedded Actions..........38<br>Debugging Yacc...........39<br>Bibliography............40<br>