ttcrypt 0.0.2

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: f88c032607b33e66a47343f5993bb7884925d17f
+  data.tar.gz: 7ca31bdfa0f0401b1e6cbd3c4c0ce8b19f0f6a6a
+SHA512:
+  metadata.gz: 3842c52dc96065852cf4d0cf854e0960f165ddb6421cc3efd7b5eae28a1509928949587dd0241caee0a97875cbe823ab07c86070afd5ac33ab4c0464d1cda2da
+  data.tar.gz: 0f26cfda18f8aca504cf6a00505fd933326fb03fb4c1262262fb1fc75e02d057d1858cc7a38ba43815d1aa21529265849b0d46b876ece5b7de9e69fbbae7c65b

data/.gitignore

@@ -0,0 +1,27 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+Gemfile.lock
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp
+*.bundle
+*.so
+*.o
+*.a
+mkmf.log
+.settings
+.idea
+.cproject
+.project
+**/.DS_Store

data/.rspec

@@ -0,0 +1,2 @@
+--color
+--format progress

data/Gemfile

@@ -0,0 +1,5 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in ttcrypt.gemspec
+gemspec
+

data/LICENSE.txt

@@ -0,0 +1,44 @@
+ Copyright (C) 2014 Sergey S. Chernov.
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+ 
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ GNU General Public License for more details.
+ 
+ You should have received a copy of the GNU General Public License
+ along with this program.  If not, see <http://www.gnu.org/licenses/>. 
+ 
+------------------------------------------------------------------------
+
+ This software includes sha1 implementation by Micael Hildenborg:
+ 
+ Copyright (c) 2011, Micael Hildenborg
+ All rights reserved.
+
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions are met:
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+    * Neither the name of Micael Hildenborg nor the
+      names of its contributors may be used to endorse or promote products
+      derived from this software without specific prior written permission.
+
+ THIS SOFTWARE IS PROVIDED BY Micael Hildenborg ''AS IS'' AND ANY
+ EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ DISCLAIMED. IN NO EVENT SHALL Micael Hildenborg BE LIABLE FOR ANY
+ DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+ ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+

data/README.md

@@ -0,0 +1,45 @@
+# TTCrypt
+
+Attention: this version is yet not fully functional.
+
+TTCrypt is a fast basic cryptography library written in C++ that implements only string encoded RSA 
+variants and othe cryptoprimitives widely used in Thrift projects, namely:
+
+* RSAES-OAEP encryption
+* RSASS-PSS signing
+* Pollard 'rho' factorization
+* SHA1 and SHA256 hashes (under development)
+* RJ256/256 (under development)
+
+## Installation
+
+Current implementation targeted fro MRI ruby 2.0+.
+
+To install your computer should have GMP library installed. Use your target system's packet manager
+(apt, brew, whatever you have) or get it there: https://gmplib.org
+
+Then, add this line to your application's Gemfile:
+
+    gem 'ttcrypt'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install ttcrypt
+
+## Usage
+
+So far you can use rdoc.
+
+TODO: Write usage instructions here
+
+## Contributing
+
+1. Fork it ( https://github.com/[my-github-username]/ttcrypt/fork )
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create a new Pull Request

data/Rakefile

@@ -0,0 +1,10 @@
+require "bundler/gem_tasks"
+require "rake/extensiontask"
+
+Rake::ExtensionTask.new "ttcrypt" do |ext|
+  ext.lib_dir = "lib/ttcrypt"
+  ext.source_pattern = "*.{c,cpp}"
+  # ext.gem_spec = spec
+end
+
+

data/ext/ttcrypt/.gitignore

@@ -0,0 +1 @@
+/Makefile

data/ext/ttcrypt/big_integer.cpp

@@ -0,0 +1,59 @@
+//
+//  big_integer.cpp
+//  zcoin
+//
+//  Created by Sergey Chernov on 10.06.14.
+//  Copyright (c) 2014 thrift. All rights reserved.
+//
+
+/*
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*/
+
+#include <stdio.h>
+#include <assert.h>
+#include "big_integer.h"
+
+namespace thrift {
+    
+    static byte clear_masks[] = {
+        0,      // never used
+        0x7F,               // clear only MSB
+        0x3F, 0x1F, 0x0F,
+        0x07, 0x03,
+        0x01                // leave only LSB
+    };
+    
+    big_integer big_integer::random_bits(unsigned int n_bits) {
+        // big_integer is BIG ENDIAN, e.g. MSB first
+        // so we can generate random sequence and mask out high bits
+        unsigned n_bytes = (n_bits + 7) / 8;
+        unsigned mask_bits = n_bytes*8 - n_bits;
+        assert(mask_bits < 8);
+        byte_buffer res = byte_buffer::random(n_bytes);
+        if( mask_bits != 0 ) {
+            res.set(0, res.at(0) & clear_masks[mask_bits]);
+        }
+        return big_integer(res);
+    }
+    
+    big_integer big_integer::random_between(const thrift::big_integer &min, const thrift::big_integer &max) {
+        auto delta = max - min;
+        auto r = big_integer::random_bits(delta.bit_length());
+        if( r > delta )
+            r = r % delta;
+        return min + r;
+    }
+    
+}

data/ext/ttcrypt/big_integer.h

@@ -0,0 +1,321 @@
+//
+//  big_integer.h
+//  zcoin
+//
+//  Created by Sergey Chernov on 03.06.14.
+//  Copyright (c) 2014 thrift. All rights reserved.
+//
+
+/*
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*/
+
+#ifndef zcoin_big_integer_h
+#define zcoin_big_integer_h
+
+#include <gmp.h>
+#include <string.h>
+#include "byte_buffer.h"
+#include "common_utils.h"
+
+using namespace std;
+
+namespace thrift {
+    
+
+    struct big_divmod_t;
+    
+    class big_integer {
+    public:
+        big_integer() {
+            //        log_d("def ctor");
+            mpz_init(val);
+        }
+        
+        big_integer(long value) {
+            //        log_d("long ctor %ld",value);
+            mpz_init_set_si(val, value);
+        }
+        
+        ~big_integer() {
+            // It can be moved
+            if( *((byte*)&val) != 0 )
+                mpz_clear(val);
+        }
+        
+        big_integer(const big_integer& x) {
+            log_d("copy constructor");
+            mpz_init(val);
+            mpz_set(val, x.val);
+        }
+        
+        big_integer(big_integer&& x) {
+            log_d("move constructor");
+            memcpy(&val, &x.val, sizeof(val));
+            memset((void*)&x.val, 0, sizeof(val));
+        }
+        
+        /**
+         Import from string representation using a given base
+         */
+        big_integer(const string& string_value,int base=10) {
+            mpz_init_set_str(val, string_value.c_str(), base);
+        }
+        
+        /**
+         Import from BIG ENDIAN byte array 
+         */
+        big_integer(const byte_buffer& bytes) {
+            mpz_init(val);
+            // mpz_import (mpz_t rop, size_t count, int order, size_t size, int endian, size_t nails, const void *op)
+            mpz_import(val, bytes.size(), 1, 1, 1, 0, bytes.data().get());
+        }
+        
+        const big_integer& operator=(const big_integer&& x) noexcept {
+//            log_d("move assign");
+            memcpy(&val, &x.val, sizeof(val));
+            memset((void*)&x.val, 0, sizeof(val));
+            return *this;
+        }
+        
+        const big_integer& operator=(const big_integer& x) noexcept {
+            log_d("copy assign");
+            mpz_set(val, x.val);
+            return *this;
+        }
+        
+        big_integer operator+(const big_integer& b) const noexcept {
+            big_integer res;
+            mpz_add(res.val, val, b.val);
+            return res;
+        }
+        
+//        big_integer& operator+=(const big_integer& b) noexcept {
+//            mpz_add(val, val, b.val);
+//            return *this;
+//        }
+        
+        big_integer operator-(const big_integer& b) const noexcept {
+            big_integer res;
+            mpz_sub(res.val, val, b.val);
+            return res;
+        }
+        
+        big_integer operator*(const big_integer& b) const noexcept {
+            big_integer res;
+            mpz_mul(res.val, val, b.val);
+            return res;
+        }
+        
+        big_integer operator/(const big_integer& b) const noexcept {
+            big_integer res;
+            mpz_fdiv_q(res.val, val, b.val);
+            return res;
+        }
+        
+        big_integer operator % (const big_integer& d) const noexcept {
+            big_integer res;
+            mpz_fdiv_r(res.val, val, d.val);
+            return res;
+        }
+        
+        big_integer operator <<(unsigned shift) const noexcept {
+            big_integer res;
+            mpz_mul_2exp(res.val, val, shift);
+            return res;
+        }
+        
+        bool operator==(const big_integer& other) const noexcept {
+            return mpz_cmp(val, other.val) == 0;
+        }
+        
+        bool operator==(long other) const noexcept {
+            return mpz_cmp_si(val, other) == 0;
+        }
+        
+        bool operator<(const big_integer& other) const noexcept {
+            return mpz_cmp(val, other.val) < 0;
+        }
+        
+        bool operator<(long other) const noexcept {
+            return mpz_cmp_si(val, other) < 0;
+        }
+        
+        bool is_odd() const noexcept {
+            return mpz_odd_p(val);
+        }
+        
+        bool is_even() const noexcept {
+            return mpz_even_p(val);
+        }
+        
+        size_t size_in_base(int base) {
+            return mpz_sizeinbase(val, base);
+        }
+        
+        big_integer operator-() const noexcept {
+            big_integer res;
+            mpz_neg(res.val, val);
+            return res;
+        }
+        
+        unsigned bit_length() const noexcept {
+            return (unsigned)mpz_sizeinbase(val, 2);
+        }
+        
+        string to_string(int base=10) const noexcept {
+            size_t length = mpz_sizeinbase(val, base) + 2;
+            char *buffer = new char[length];
+            mpz_get_str(buffer, base, val);
+            string res = string(buffer);
+            delete buffer;
+            return res;
+        }
+        
+        string hex() const noexcept { return to_string(16); }
+        
+        long to_long() const noexcept {
+            return mpz_get_si(val);
+        }
+
+        /**
+         Convert to BIE ENDIAN bytes array.
+         */
+        byte_buffer to_byte_buffer() const noexcept {
+            size_t count = (mpz_sizeinbase (val, 2) + 7) / 8;
+            byte_buffer res = byte_buffer(count);
+            size_t count2 = count;
+            // mpz_export (void *rop, size_t *countp, int order, size_t size, int endian, size_t nails, const mpz_t op)
+            mpz_export( res.data().get(), &count2, 1, 1, 1, 0, val);
+            if( count != count2 && count2 != 0 )
+                throw logic_error("mpz export logic failed");
+            return res;
+        }
+        
+        /**
+         Test that *this is probably a prime. 
+         @param reps number of Rabin-Miller tests. 25 gives an error probability 2e-50 that is usually
+                     sufficient.
+         */
+        bool is_prime(int reps=25) const noexcept {
+            return mpz_probab_prime_p(val, reps) != 0;
+        }
+        
+        /**
+         Generate random integer I such as 0 <= I <= 2 ** n_bits. Uses byte_buffer (good) uniform
+         random engine.
+         */
+        static big_integer random_bits(unsigned n_bits);
+        
+        /**
+         Generate random integer in the given INCLUSIVE interval
+         */
+        static big_integer random_between(const big_integer& min,const big_integer& max);
+        
+        friend big_integer operator*(int a,const big_integer& b) noexcept;
+        friend big_integer pow(const big_integer& x,unsigned long y) noexcept;
+        friend big_integer powmod(const big_integer& x,const big_integer& y,const big_integer& mod) noexcept;
+        friend big_integer powmod_sec(const big_integer& x,const big_integer& y,const big_integer& mod) noexcept;
+        friend big_integer abs(const big_integer& x) noexcept;
+        friend big_integer inverse(const big_integer& u,const big_integer& v) noexcept;
+        
+        friend big_integer lcm(const big_integer& u,const big_integer& v) noexcept;
+        friend big_integer gcd(const big_integer& u,const big_integer& v) noexcept;
+        
+        friend big_integer next_prime(const big_integer& i) noexcept;
+        
+        friend big_divmod_t divmod(const big_integer& n, const big_integer& d) noexcept;
+        
+    private:
+        mpz_t val;
+    };
+    
+    inline big_integer operator "" _b(const char* str) {
+        return big_integer(str, 10);
+    }
+    
+    inline big_integer operator*(int a,const big_integer& b) noexcept {
+        big_integer res;
+        mpz_mul_si(res.val,b.val, a);
+        return res;
+    }
+    
+    inline big_integer pow(const big_integer& x,unsigned long y) noexcept {
+        big_integer res;
+        mpz_pow_ui(res.val, x.val, y);
+        return res;
+    }
+    
+    inline big_integer powmod(const big_integer& x,const big_integer& y,const big_integer& mod) noexcept {
+        big_integer res;
+        mpz_powm(res.val, x.val, y.val, mod.val);
+        return res;
+    }
+    
+    inline big_integer powmod_sec(const big_integer& x,const big_integer& y,const big_integer& mod) noexcept {
+        big_integer res;
+        mpz_powm_sec(res.val, x.val, y.val, mod.val);
+        return res;
+    }
+    
+    
+    inline string operator+(const string& str, const big_integer& i) {
+        return str + i.to_string();
+    }
+    
+    inline string string_value(const big_integer &x) noexcept {
+        return x.to_string();
+    }
+    
+    inline ostream& operator << (ostream& s,const big_integer& value) {
+        return s << value.to_string();
+    }
+    
+    inline big_integer inverse(const big_integer& u,const big_integer& v) noexcept {
+        big_integer res;
+        mpz_invert(res.val, u.val, v.val);
+        return res;
+    }
+    
+    inline big_integer lcm(const big_integer& u,const big_integer& v) noexcept {
+        big_integer res;
+        mpz_lcm(res.val, u.val, v.val);
+        return res;
+    }
+    
+    inline big_integer gcd(const big_integer& u,const big_integer& v) noexcept {
+        big_integer res;
+        mpz_gcd(res.val, u.val, v.val);
+        return res;
+    }
+    
+    inline big_integer next_prime(const big_integer& i) noexcept {
+        big_integer next;
+        mpz_nextprime(next.val, i.val);
+        return next;
+    }
+    
+    struct big_divmod_t {
+        big_integer q;
+        big_integer r;
+    };
+    
+    inline big_divmod_t divmod(const big_integer& n,const big_integer& d) noexcept {
+        big_divmod_t result;
+        mpz_fdiv_qr(result.q.val, result.r.val, n.val, d.val);
+        return result;
+    }
+}
+
+#endif

data/ext/ttcrypt/byte_buffer.cpp

@@ -0,0 +1,84 @@
+//
+//  byte_buffer.cpp
+//  zcoin
+//
+//  Created by Sergey Chernov on 02.06.14.
+//  Copyright (c) 2014 thrift. All rights reserved.
+//
+
+/*
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*/
+
+#include <random>
+#include "byte_buffer.h"
+#include "common_utils.h"
+#include "text_utils.h"
+
+namespace thrift {
+    
+    char next_non_space_char(const char*& src) {
+        char ch;
+        while( (ch=*src) != 0 ) {
+            src++;
+            switch (ch) {
+                case ' ': case '\t': case '\n': case '\r':
+                    break;
+                default:
+                    return ch;
+            }
+        }
+        return 0;
+    }
+    
+    int hex_digit_value(char hex_digit) {
+        char c = toupper(hex_digit);
+        if( c >= 'A' && c <= 'F' )
+            return c - 'A' + 10;
+        if( c >= '0' && c <= '9' )
+            return c - '0';
+        throw new invalid_argument(sformat("Invalid hex character %c", c));
+    }
+    
+    byte_buffer decode_hex(const string& hex) {
+        const char *ptr = hex.c_str();
+        byte_buffer res;
+        do {
+            char c1 = next_non_space_char(ptr);
+            if( !c1 ) break;
+            char c2 = next_non_space_char(ptr);
+            if( !c2 )
+                throw invalid_argument("hex has uneven number of digits");
+            res.append_byte( (hex_digit_value(c1) << 4) + hex_digit_value(c2) );
+        } while(true);
+        return res;
+    }
+    
+    byte_buffer& byte_buffer::operator += (const byte_buffer& other) noexcept {
+        ensure_capacity(length + other.length);
+        memcpy(buffer.get() + length, other.buffer.get(), other.length);
+        length += other.length;
+        return *this;
+    }
+    
+    static auto random_engine = std::mt19937_64(std::random_device{}());
+    
+    byte_buffer byte_buffer::random(size_t size) {
+        byte_buffer result(size);
+        for(size_t i=0; i<size; i++)
+            result.set(i, (byte)random_engine());
+        return result;
+    }
+}
+