Earlier this week I had a discussion about the running time of an algorithm used to test a method. This got me thinking about one of my favourite areas of computer science - computational complexity. We can use complexity theory to split problems into classes. Understanding some of these classes can help us to recognise when … Continue reading Stop trying to solve hard problems!
I found it impossible to find a segment of code which showed how to generate a secure key pair in the enclave with swift for iOS 9. So... here it is! // private key parameters let privateKeyParams: [String: AnyObject] = [ kSecAttrLabel as String: "privateLabel", kSecAttrIsPermanent as String: true, kSecAttrApplicationTag as String: … Continue reading Generating a Key Pair with iOS’s Secure Enclave in Swift
As part of a placement earlier this year, I was given two sets of functions to play with. The first set was implemented in both MATLAB and FORTRAN and formed a root-finding algorithm. The second was implemented in only MATLAB but promised shorter running times and greater accuracy. The task was to compare the two … Continue reading A perfect matching of complex roots
