Alexander Oprisnik

Alexander Oprisnik

Android Developer · Pianist · IT Security Researcher

Android applications and games

BallMaze

BallMaze

BallMaze is a fun and addicting puzzle game. You have to get the ball on a target field by rolling it through an unlimited number of challenging mazes.

The rules are simple:
The ball rolls until it hits an obstacle. Blocking fields have different colors and you can select which color blocks the ball. Different game modes include real-time multiplayer challenges as well as singleplayer fun. YouTube video.

Stackr

Stackr

How high can you stack it?

Stackr is a challenging arcade game - simply stack the blocks as high as you can.
The following four items can be used once per game to improve your score:

  • Slow: Slows down the game.
  • Widen: Make everything wider.
  • Sticky: The row is glued together.
  • Reset: Reset the game and keep your points.
smsSync

smsSync

I am currently working on a big update with a completely new design (as seen in the picture above).

smsSync is a powerful SMS application. In addition, it allows you to send and receive SMS messages from your tablet and from other devices.

You can pair your devices using NFC. The devices are then synchronized locally via Wi-Fi.

Research

Semdroid - Semantic Android Application Analysis Using Machine Learning (Master's Thesis, 2014)

Semdroid is a static Android application analysis framework that allows to detect certain functionality included in applications, like cryptographic code or SMS functionality.

Learn more Source code on GitHub

Android Security (2013 – now)

Performed several Android security assessments and implemented malware detection mechanisms:

Ricochet Robots

Ricochet Robots (2011)

Ricochet Robots is a board game where the players have to find the shortest path to a given target field by moving different robots.

  • Goal: find the best solution as fast as possible.
  • Implemented the playable game in Java, including a customizable user interface (Java Swing toolkit).
  • Developed several heuristics that work together to solve the NP-complete problem.
  • Found solutions can be displayed step by step or automatically.
  • Great results: the shortest solutions can be found very efficiently (< 10 ms for most scenarios).

Publications

2014

2013

2012