Back to search

University of Victoria (Canada)

Fast Low Memory T-Transform: string complexity in linear time and space with applications to Android app store security.

Abstract

dc:description.abstract

This thesis presents flott, the Fast Low Memory T-Transform, the currently fastest and most memory efficient linear time and space algorithm available to compute the string complexity measure T-complexity. The flott algorithm uses 64.3% less memory and in our experiments runs asymptotically 20% faster than its predecessor. A full C-implementation is provided and published under the Apache Licence 2.0. From the flott algorithm two deterministic information measures are derived and applied to Android app store security. The derived measures are the normalized T-complexity distance and the instantaneous T-complexity rate which are used to detect, locate, and visualize unusual information changes in Android applications. The information measures introduced present a novel, scalable approach to assist with the detection of malware in app stores.

Degree

thesis:*
Level thesis:degree_level
Master of Applied Science M.A.Sc.
Department thesis:degree_department
Department of Electrical and Computer Engineering
Year dc:date.issued
2012

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Rebenich, Niko
Advisor dc:contributor.supervisor
  • Neville, Stephen William

Subjects

dc:subject × 31

Rights

dc:rights
Statement dc:rights
  • Available to the World Wide Web
Language dc:language.iso
en, English

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1828/3924

Chain of custody

source
Harvested from
University of Victoria (Canada)
Base URL
dspace.library.uvic.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Rebenich, Niko. Fast Low Memory T-Transform: string complexity in linear time and space with applications to Android app store security.. Master of Applied Science M.A.Sc. thesis, 2012. http://hdl.handle.net/1828/3924