Here is a simple semiprime (N=p*q) factorization algorithm with running time O((p-q)/2). It is based on the concept of N (p*q) unit blocks being arranged into a perfect rectangle. The rectangle has ...

When working outside the walled garden of byte code VMs and interpreted languages there is always the chance you might shoot yourself in the foot. This usually results in a segfault. As ...

I don't know much about Objective-C and decided to get my learn on. Here are some discoveries I made.Objective-C is dynamic. Objects and classes support some degree of introspection at runtime. Methods ...

Often when doing mobile application assessments it is necessary to check that sensitive data is properly discarded when no longer in use. This data is often found on the heap. While it ...

Here's an interesting prime number generator that I created. It avoids multiplication and modulo arithmetic. It does not sieve a preallocated set of integers (ex. find all primes up to N). You ...

Lately, I've become interested in integer factorization and have been playing with constraint solvers. I started out with minion but quickly became frustrated. Minion does not support nesting of constraints or custom ...