Fortsätt till huvudinnehåll

RSA key manager for Windows

I spent the Friday evening coding an RSA key manager for Windows. What a great evening!

After spending quite some time reading up on cryptography in Windows I noticed that Windows have built in support for storing RSA keys securely in something called RSA Key Containers. However, there seems to be no tool available to actually manage these containers. Microsoft themselves refer to a tool called aspnet_regiis (WTF!?) for creating and exporting an RSA Key Container.

So, after spending a couple of hours behind the keyboard (Dvorak layout, VsVim in Visual Studio), I can now say a tool dedicated to creating, deleting, exporting and importing RSA Key Containers in Windows now exist.

Kommentarer

  1. Ska du bli som Hans nu? Först Vim och nu Dvorak :-o
    Har du skrivit till Microsoft och berättat att erics_regiis finns? ;)

    SvaraRadera
  2. Tvärt om. Först Dvorak och sedan Vim ;). Fast det tar ju bort lite av tjusningen när man måste lämna home row så mycket.
    Microsoft kan ladda toolet från Github om de vill. Och får gärna pusha ändringar. Tror nog inte de är så intresserade ;)

    SvaraRadera

Skicka en kommentar

Populära inlägg i den här bloggen

C# Enum as bit field

Bit field enum Whenever you wish to express combinations of properties of an object, bit fields are a good way to accomplish this. As a simple example, consider a file in the file system. It can be Readable , Writable , Hidden or a combination these. The different attributes can be defined as an enum : [Flags] public enum FileAttribute {   None      = 0b0000;   Readable  = 0b0001;   Writeable = 0b0010;   Hidden    = 0b0100; } To indicate that this enum is expected to be used as a bit field I have defined it with the FlagsAttribute . It is important to understand that the FlagsAttribute does nothing more than making some changes to how the ToString method of the enum works, making it possible to print out all flags. It does not introduce any validation or special treatment of the enum in any other way. I have defined the values of the different fields of the enum using binary representation, this should make it even more clear that this is a bit field and which bi

Codility tasks - Part I

I was recently faced with two codility tasks when applying for a job as an Embedded Software Engineer. For those of you who arn't familiar with Codility you can check out their website here:  www.codility.com Task one - Dominator The first task was called Dominator. The goal was to, given a std::vector of integers, find an integer that occurs in more than half of the positions in the vector. If no dominator was found -1 should be returned. My approach was to loop through the vector from the first to the last element, using a std::map to count the number of occurences of each integer. If the count ever reached above half the size of the vector I stopped and returned that integer and if I reached the end without finding a dominator I returned -1. So was that a good approach? Well, the reviewer at the company rated the solution as 'pretty ok'. His preferred solution was store the first integer in the array and set a counter to 1. Then loop through the remaining i