guildenstern70

from hashlib import sha1
import hmac

TEXT = "37897892379ARIU"


def hmac_msg(message):

    key = "Secr3t_passWor6"
    hashed = hmac.new(key, message, sha1)

guildenstern70

/**
 * Eratostene Sieve algorithm
 */

package eratostene

/**
 * Find prime numbers using Eratostene Sieve
 * @param maxPrime Find primes to maxPrime
 * @example

guildenstern70

/**
 * Permutations Computer
 * based on Bogolomyn algorithm
 * Author: Alessio Saltarin
 */


/**
 * Computes all permutations of a sequence of numbers
 * @param permSize size of the sequence - ie.: 7 = (1,2,3,4,5,6,7)

guildenstern70

""" 
         DirDeleter.py v0.2
         by Alessio Saltarin
 
         Usage: python dirdeleter.py [initial_directory] [string]
         
         Walks over all sub-directories starting from
         [initial_directory] and deletes every directory that has
         its name equal to [string] or containing [string]
         

guildenstern70

#!/usr/bin/env ruby

#
# Compute prime numbers
# with the good old Eratostene Sieve method
# Author: Alessio Saltarin
#


# Eratostene Sieve computer class

guildenstern70

#!/usr/bin/ruby1.8 -w

#
# A Simple Hash Code Calculator
# Returns SHA1 and MD5 hash for any given file
# Author: Alessio Saltarin
#

require 'digest/md5'
require 'digest/sha1'

guildenstern70

#!/usr/bin/env ruby
 
# PERMUTATIONS COMPUTER
# based on Bogomolyn algorithm
# http://www.bearcave.com/random_hacks/permute.html
# Author: Alessio Saltarin http://axsaxs.altervista.org/
 
class PermutationComputer
 
  attr_reader :bigbox  # Array of permutations