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

Simple item page
dc.contributor.authorRebenich, Niko
dc.contributor.supervisorNeville, Stephen William
dc.date.accessioned2012-04-27T20:09:59Z
dc.date.available2012-04-27T20:09:59Z
dc.date.copyright2012en_US
dc.date.issued2012-04-27
dc.degree.departmentDept. of Electrical and Computer Engineeringen_US
dc.degree.levelMaster of Applied Science M.A.Sc.en_US
dc.description.abstractThis 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.en_US
dc.description.scholarlevelGraduateen_US
dc.identifier.urihttp://hdl.handle.net/1828/3924
dc.languageEnglisheng
dc.language.isoenen_US
dc.rights.tempAvailable to the World Wide Weben_US
dc.subjectKolmogorov complexityen_US
dc.subjectLempelen_US
dc.subjectZiven_US
dc.subjectT-codesen_US
dc.subjectflotten_US
dc.subjectFast T-decompositionen_US
dc.subjectftden_US
dc.subjectmobile computingen_US
dc.subjectLempel-Ziv complexityen_US
dc.subjectLZ complexityen_US
dc.subjectLZ78en_US
dc.subjectLZ77en_US
dc.subjectLZ76en_US
dc.subjectLZWen_US
dc.subjectnormalized information distanceen_US
dc.subjectNIDen_US
dc.subjectnormalized compression distanceen_US
dc.subjectNCDen_US
dc.subjectMcCreighten_US
dc.subjectUkkonenen_US
dc.subjectphylogeneticsen_US
dc.subjectphylogenetic treeen_US
dc.subjectGeminien_US
dc.subjectDroiddreamen_US
dc.subjectAppleen_US
dc.subjectiOSen_US
dc.subjectiPhoneen_US
dc.subjectiPaden_US
dc.subjectmobile phoneen_US
dc.subjectopen sourceen_US
dc.subjectApache License 2.0en_US
dc.titleFast Low Memory T-Transform: string complexity in linear time and space with applications to Android app store security.en_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Niko_Rebenich_MASc_2012.pdf
Size:
1.5 MB
Format:
Adobe Portable Document Format
Description:
M.A.Sc. Thesis, Niko Rebenich
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.74 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Electronic Theses and Dissertations (ETD)
Theses (Electrical and Computer Engineering)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.