ecdsa_ext 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 3b62285517cc90d7dcb953cc669c69c22883e2804f729bf28e937922b43439aa
+  data.tar.gz: 99f865acb675894ad30c868ddd7ce421c9a84fd063c4e57c5abe022419abf85c
+SHA512:
+  metadata.gz: 932217994dec3b19d5896eae554b94a98180d37836af0c921aaf08bc0667787a871cfc19d3745ffd538c3b6adca86a02ace890e5fd746ab406e97e6c7d8fbbac
+  data.tar.gz: 35a8165ff84e644ad6866208d3bacc930112b37e999e1bfafc898b73825175983fb4a0875d8e2fcde1a60450b8a8d98bca0e533f204a65da7736a946a88124c3

data/.prettierignore

@@ -0,0 +1,2 @@
+/bin
+/vendor

data/.rspec

@@ -0,0 +1,3 @@
+--format documentation
+--color
+--require spec_helper

data/.rubocop.yml

@@ -0,0 +1,21 @@
+require:
+  - rubocop-rake
+  - rubocop-rspec
+inherit_gem:
+  prettier: rubocop.yml
+AllCops:
+  TargetRubyVersion: 3.0
+RSpec/ExampleLength:
+  Enabled: false
+Metrics:
+  Enabled: false
+RSpec/MultipleExpectations:
+  Max: 5
+Style/IfUnlessModifier:
+  Enabled: false
+Style/WhileUntilModifier:
+  Enabled: false
+Naming/MethodParameterName:
+  Enabled: false
+RSpec/FilePath:
+  Enabled: false

data/.ruby-gemset

@@ -0,0 +1 @@
+ecdsa_ext

data/.ruby-version

@@ -0,0 +1 @@
+ruby-3.2.0

data/CHANGELOG.md

@@ -0,0 +1,5 @@
+## [Unreleased]
+
+## [0.1.0] - 2023-02-23
+
+- Initial release

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,84 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+We as members, contributors, and leaders pledge to make participation in our community a harassment-free experience for everyone, regardless of age, body size, visible or invisible disability, ethnicity, sex characteristics, gender identity and expression, level of experience, education, socio-economic status, nationality, personal appearance, race, religion, or sexual identity and orientation.
+
+We pledge to act and interact in ways that contribute to an open, welcoming, diverse, inclusive, and healthy community.
+
+## Our Standards
+
+Examples of behavior that contributes to a positive environment for our community include:
+
+* Demonstrating empathy and kindness toward other people
+* Being respectful of differing opinions, viewpoints, and experiences
+* Giving and gracefully accepting constructive feedback
+* Accepting responsibility and apologizing to those affected by our mistakes, and learning from the experience
+* Focusing on what is best not just for us as individuals, but for the overall community
+
+Examples of unacceptable behavior include:
+
+* The use of sexualized language or imagery, and sexual attention or
+  advances of any kind
+* Trolling, insulting or derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or email
+  address, without their explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Enforcement Responsibilities
+
+Community leaders are responsible for clarifying and enforcing our standards of acceptable behavior and will take appropriate and fair corrective action in response to any behavior that they deem inappropriate, threatening, offensive, or harmful.
+
+Community leaders have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, and will communicate reasons for moderation decisions when appropriate.
+
+## Scope
+
+This Code of Conduct applies within all community spaces, and also applies when an individual is officially representing the community in public spaces. Examples of representing our community include using an official e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be reported to the community leaders responsible for enforcement at azuchi@chaintope.com. All complaints will be reviewed and investigated promptly and fairly.
+
+All community leaders are obligated to respect the privacy and security of the reporter of any incident.
+
+## Enforcement Guidelines
+
+Community leaders will follow these Community Impact Guidelines in determining the consequences for any action they deem in violation of this Code of Conduct:
+
+### 1. Correction
+
+**Community Impact**: Use of inappropriate language or other behavior deemed unprofessional or unwelcome in the community.
+
+**Consequence**: A private, written warning from community leaders, providing clarity around the nature of the violation and an explanation of why the behavior was inappropriate. A public apology may be requested.
+
+### 2. Warning
+
+**Community Impact**: A violation through a single incident or series of actions.
+
+**Consequence**: A warning with consequences for continued behavior. No interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, for a specified period of time. This includes avoiding interactions in community spaces as well as external channels like social media. Violating these terms may lead to a temporary or permanent ban.
+
+### 3. Temporary Ban
+
+**Community Impact**: A serious violation of community standards, including sustained inappropriate behavior.
+
+**Consequence**: A temporary ban from any sort of interaction or public communication with the community for a specified period of time. No public or private interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, is allowed during this period. Violating these terms may lead to a permanent ban.
+
+### 4. Permanent Ban
+
+**Community Impact**: Demonstrating a pattern of violation of community standards, including sustained inappropriate behavior,  harassment of an individual, or aggression toward or disparagement of classes of individuals.
+
+**Consequence**: A permanent ban from any sort of public interaction within the community.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 2.0,
+available at https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
+
+Community Impact Guidelines were inspired by [Mozilla's code of conduct enforcement ladder](https://github.com/mozilla/diversity).
+
+[homepage]: https://www.contributor-covenant.org
+
+For answers to common questions about this code of conduct, see the FAQ at
+https://www.contributor-covenant.org/faq. Translations are available at https://www.contributor-covenant.org/translations.

data/Gemfile

@@ -0,0 +1,15 @@
+# frozen_string_literal: true
+
+source "https://rubygems.org"
+
+# Specify your gem's dependencies in ecdsa_ext.gemspec
+gemspec
+
+gem "rake", "~> 13.0"
+
+gem "rspec", "~> 3.0"
+
+gem 'prettier'
+
+gem 'rubocop-rake'
+gem 'rubocop-rspec'

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2023 azuchi
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,43 @@
+# EcdsaExt
+
+Welcome to your new gem! In this directory, you'll find the files you need to be able to package up your Ruby library into a gem. Put your Ruby code in the file `lib/ecdsa_ext`. To experiment with that code, run `bin/console` for an interactive prompt.
+
+TODO: Delete this and the text above, and describe your gem
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'ecdsa_ext'
+```
+
+And then execute:
+
+    $ bundle install
+
+Or install it yourself as:
+
+    $ gem install ecdsa_ext
+
+## Usage
+
+TODO: Write usage instructions here
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake spec` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and the created tag, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/ecdsa_ext. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [code of conduct](https://github.com/[USERNAME]/ecdsa_ext/blob/master/CODE_OF_CONDUCT.md).
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
+
+## Code of Conduct
+
+Everyone interacting in the EcdsaExt project's codebases, issue trackers, chat rooms and mailing lists is expected to follow the [code of conduct](https://github.com/[USERNAME]/ecdsa_ext/blob/master/CODE_OF_CONDUCT.md).

data/Rakefile

@@ -0,0 +1,8 @@
+# frozen_string_literal: true
+
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)
+
+task default: :spec

data/bin/console

@@ -0,0 +1,15 @@
+#!/usr/bin/env ruby
+# frozen_string_literal: true
+
+require "bundler/setup"
+require "ecdsa_ext"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require "irb"
+IRB.start(__FILE__)

data/bin/setup

@@ -0,0 +1,8 @@
+#!/usr/bin/env bash
+set -euo pipefail
+IFS=$'\n\t'
+set -vx
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/ecdsa_ext.gemspec

@@ -0,0 +1,38 @@
+# frozen_string_literal: true
+
+require_relative "lib/ecdsa/ext/version"
+
+Gem::Specification.new do |spec|
+  spec.name = "ecdsa_ext"
+  spec.version = ECDSA::Ext::VERSION
+  spec.authors = ["azuchi"]
+  spec.email = ["techmedia.think@gmail.com"]
+
+  spec.summary = "Extension of the ecdsa gem."
+  spec.description = spec.summary
+  spec.homepage = "https://github.com/azuchi/ruby_ecdsa_ext"
+  spec.license = "MIT"
+  spec.required_ruby_version = ">= 3.0.0"
+
+  spec.metadata["homepage_uri"] = spec.homepage
+  spec.metadata["source_code_uri"] = spec.homepage 
+  spec.metadata["changelog_uri"] = spec.homepage
+
+  # Specify which files should be added to the gem when it is released.
+  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
+  spec.files = Dir.chdir(File.expand_path(__dir__)) do
+    `git ls-files -z`.split("\x0").reject do |f|
+      (f == __FILE__) || f.match(%r{\A(?:(?:test|spec|features)/|\.(?:git|travis|circleci)|appveyor)})
+    end
+  end
+  spec.bindir = "exe"
+  spec.executables = spec.files.grep(%r{\Aexe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+
+  # Uncomment to register a new dependency of your gem
+  # spec.add_dependency "example-gem", "~> 1.0"
+  spec.add_dependency "ecdsa", "~> 1.2.0"
+
+  # For more information and examples about making a new gem, check out our
+  # guide at: https://bundler.io/guides/creating_gem.html
+end

data/lib/ecdsa/ext/point_arithmetic.rb

@@ -0,0 +1,143 @@
+# frozen_string_literal: true
+module ECDSA
+  module Ext
+    # Point arithmetic implementation
+    module PointArithmetic
+      def addition_negative3(a, b)
+        field = a.field
+        xx = field.mod(a.x * b.x)
+        yy = field.mod(a.y * b.y)
+        zz = field.mod(a.z * b.z)
+        xy_pairs = field.mod((a.x + a.y) * (b.x + b.y) - (xx + yy))
+        yz_pairs = field.mod((a.y + a.z) * (b.y + b.z) - (yy + zz))
+        xz_pairs = field.mod((a.x + a.z) * (b.x + b.z) - (xx + zz))
+
+        bzz_part = field.mod(xz_pairs - a.group.param_b * zz)
+        bzz3_part = field.mod(bzz_part * 2 + bzz_part)
+        yy_m_bzz3 = field.mod(yy - bzz3_part)
+        yy_p_bzz3 = field.mod(yy + bzz3_part)
+
+        zz3 = field.mod(zz * 3)
+        bxz_part = field.mod(a.group.param_b * xz_pairs - (zz3 + xx))
+        bxz3_part = field.mod(bxz_part * 3)
+        xx3_m_zz3 = field.mod(xx * 3 - zz3)
+
+        x = field.mod(yy_p_bzz3 * xy_pairs - yz_pairs * bxz3_part)
+        y = field.mod(yy_p_bzz3 * yy_m_bzz3 + xx3_m_zz3 * bxz3_part)
+        z = field.mod(yy_m_bzz3 * yz_pairs + xy_pairs * xx3_m_zz3)
+        ProjectivePoint.new(a.group, x, y, z)
+      end
+
+      def addition_any(a, b)
+        field = a.field
+        b3 = field.mod(3 * group.param_b)
+        t0 = field.mod(a.x * b.x)
+        t1 = field.mod(a.y * b.y)
+        t2 = field.mod(a.z * b.z)
+        t3 = field.mod(a.x + a.y)
+        t4 = field.mod(b.x + b.y)
+        t3 = field.mod(t3 * t4)
+        t4 = field.mod(t0 + t1)
+        t3 = field.mod(t3 - t4)
+        t4 = field.mod(a.x + a.z)
+        t5 = field.mod(b.x + b.z)
+        t4 = field.mod(t4 * t5)
+        t5 = field.mod(t0 + t2)
+        t4 = field.mod(t4 - t5)
+        t5 = field.mod(a.y + a.z)
+        x3 = field.mod(b.y + b.z)
+        t5 = field.mod(t5 * x3)
+        x3 = field.mod(t1 + t2)
+        t5 = field.mod(t5 - x3)
+        z3 = field.mod(a.group.param_a * t4)
+        x3 = field.mod(b3 * t2)
+        z3 = field.mod(x3 + z3)
+        x3 = field.mod(t1 - z3)
+        z3 = field.mod(t1 + z3)
+        y3 = field.mod(x3 * z3)
+        t1 = field.mod(t0 + t0)
+        t1 = field.mod(t1 + t0)
+        t2 = field.mod(a.group.param_a * t2)
+        t4 = field.mod(b3 * t4)
+        t1 = field.mod(t1 + t2)
+        t2 = field.mod(t0 - t2)
+        t2 = field.mod(a.group.param_a * t2)
+        t4 = field.mod(t4 + t2)
+        t0 = field.mod(t1 * t4)
+        y3 = field.mod(y3 + t0)
+        t0 = field.mod(t5 * t4)
+        x3 = field.mod(t3 * x3)
+        x3 = field.mod(x3 - t0)
+        t0 = field.mod(t3 * t1)
+        z3 = field.mod(t5 * z3)
+        z3 = field.mod(z3 + t0)
+        ProjectivePoint.new(a.group, x3, y3, z3)
+      end
+
+      def double_negative3(point)
+        field = point.field
+        xx = field.power(point.x, 2)
+        yy = field.power(point.y, 2)
+        zz = field.power(point.z, 2)
+        xy2 = field.mod(point.x * point.y * 2)
+        xz2 = field.mod(point.x * point.z * 2)
+
+        bzz_part = field.mod(point.group.param_b * zz - xz2)
+        bzz3_part = field.mod(bzz_part + bzz_part + bzz_part)
+        yy_m_bzz3 = field.mod(yy - bzz3_part)
+        yy_p_bzz3 = field.mod(yy + bzz3_part)
+        y_frag = field.mod(yy_p_bzz3 * yy_m_bzz3)
+        x_frag = field.mod(yy_m_bzz3 * xy2)
+
+        zz3 = field.mod(zz * 3)
+        bxz2_part = field.mod(point.group.param_b * xz2 - (zz3 + xx))
+        bxz6_part = field.mod(bxz2_part * 3)
+        xx3_m_zz3 = field.mod(xx * 3 - zz3)
+
+        y = field.mod(y_frag + xx3_m_zz3 * bxz6_part)
+        yz2 = field.mod(point.y * point.z * 2)
+        x = field.mod(x_frag - bxz6_part * yz2)
+        z = field.mod(yz2 * yy * 4)
+        ProjectivePoint.new(point.group, x, y, z)
+      end
+
+      def double_any(point)
+        field = point.field
+        b3 = field.mod(point.group.param_b * 3)
+
+        t0 = field.mod(point.x * point.x)
+        t1 = field.mod(point.y * point.y)
+        t2 = field.mod(point.z * point.z)
+        t3 = field.mod(point.x * point.y)
+        t3 = field.mod(t3 + t3)
+        z3 = field.mod(point.x * point.z)
+        z3 = field.mod(z3 + z3)
+        x3 = field.mod(point.group.param_a * z3)
+        y3 = field.mod(b3 * t2)
+        y3 = field.mod(x3 + y3)
+        x3 = field.mod(t1 - y3)
+        y3 = field.mod(t1 + y3)
+        y3 = field.mod(x3 * y3)
+        x3 = field.mod(t3 * x3)
+        z3 = field.mod(b3 * z3)
+        t2 = field.mod(point.group.param_a * t2)
+        t3 = field.mod(t0 - t2)
+        t3 = field.mod(point.group.param_a * t3)
+        t3 = field.mod(t3 + z3)
+        z3 = field.mod(t0 + t0)
+        t0 = field.mod(z3 + t0)
+        t0 = field.mod(t0 + t2)
+        t0 = field.mod(t0 * t3)
+        y3 = field.mod(y3 + t0)
+        t2 = field.mod(point.y * point.z)
+        t2 = field.mod(t2 + t2)
+        t0 = field.mod(t2 * t3)
+        x3 = field.mod(x3 - t0)
+        z3 = field.mod(t2 * t1)
+        z3 = field.mod(z3 + z3)
+        z3 = field.mod(z3 + z3)
+        ProjectivePoint.new(point.group, x3, y3, z3)
+      end
+    end
+  end
+end

data/lib/ecdsa/ext/projective_point.rb

@@ -0,0 +1,152 @@
+# frozen_string_literal: true
+
+module ECDSA
+  module Ext
+    # Representing a point on elliptic curves using projective coordinates.
+    class ProjectivePoint
+      include PointArithmetic
+
+      attr_reader :group, :x, :y, :z
+
+      # Create new instance of projective
+      # @param [ECDSA::Group] group
+      # @param [Array] args [:infinity] or [x, y, z]
+      # @return [ECDSA::Ext::ProjectivePoint]
+      def initialize(group, *args)
+        @group = group
+        @x, @y, @z = args
+        raise ArgumentError, "Invalid x: #{x.inspect}" unless x.is_a?(Integer)
+        raise ArgumentError, "Invalid y: #{y.inspect}" unless y.is_a?(Integer)
+        raise ArgumentError, "Invalid z: #{z.inspect}" unless z.is_a?(Integer)
+      end
+
+      # Get filed of this group.
+      # @return [ECDSA::PrimeField]
+      def field
+        group.field
+      end
+
+      # Convert coordinates from affine to projective.
+      # @param [ECDSA::Point] point
+      # @return [ECDSA::Ext::ProjectivePoint]
+      def self.from_affine(point)
+        if point.infinity?
+          ProjectivePoint.infinity(point.group)
+        else
+          new(point.group, point.x, point.y, 1)
+        end
+      end
+
+      # Create infinity
+      # @return [ECDSA::Ext::ProjectivePoint]
+      def self.infinity(group)
+        # new(group, :infinity)
+        new(group, 0, 1, 0)
+      end
+
+      # Check whether infinity point or not.
+      # @return [Boolean]
+      def infinity?
+        x.zero? && y == 1 && z.zero?
+      end
+
+      # Add this point to another point on the same curve.
+      # @param [ECDSA::Ext::ProjectivePoint] other
+      # @return [ECDSA::Ext::ProjectivePoint]
+      def add_to_point(other)
+        unless other.is_a?(ProjectivePoint)
+          raise ArgumentError, "other point must be instance of ProjectivePoint"
+        end
+        unless other.group == group
+          raise ArgumentError, "other group must be same group of this point"
+        end
+
+        return other if infinity?
+        return self if other.infinity?
+
+        if x == other.x && y == field.mod(-other.y) && z == other.z
+          return ProjectivePoint.infinity(group)
+        end
+
+        unless x == other.x
+          return(
+            (
+              if group.param_a == field.mod(-3)
+                addition_negative3(self, other)
+              else
+                addition_any(self, other)
+              end
+            )
+          )
+        end
+
+        return double if self == other
+        raise "Failed to add #{inspect} to #{other.inspect}: No addition rules matched."
+      end
+      alias + add_to_point
+
+      # Return the point added to itself.
+      # @return [ECDSA::Ext::ProjectivePoint]
+      def double
+        return self if infinity?
+
+        if group.param_a == field.mod(-3)
+          double_negative3(self)
+        else
+          double_any(self)
+        end
+      end
+
+      # Convert this coordinates to affine coordinates.
+      # @return [ECDSA::Point]
+      def to_affine
+        if infinity?
+          group.infinity
+        else
+          ECDSA::Point.new(
+            group,
+            field.mod(x * field.inverse(z)),
+            field.mod(y * field.inverse(z))
+          )
+        end
+      end
+
+      # Return the point multiplied by a non-negative integer.
+      # @param [Integer] x
+      # @return [ECDSA::Ext::ProjectivePoint]
+      def multiply_by_scalar(x)
+        raise ArgumentError, "Scalar is not an integer." unless x.is_a?(Integer)
+        raise ArgumentError, "Scalar is negative." if x.negative?
+
+        q = ProjectivePoint.infinity(group)
+        v = self
+        i = x
+        while i.positive?
+          q = q.add_to_point(v) if i.odd?
+          v = v.double
+          i >>= 1
+        end
+        q
+      end
+      alias * multiply_by_scalar
+
+      # Return additive inverse of the point.
+      # @return [ECDSA::Ext::ProjectivePoint]
+      def negate
+        return self if infinity?
+        ProjectivePoint.new(group, x, field.mod(-y), z)
+      end
+
+      # Return coordinates.
+      # @return [Array] (x, y , z)
+      def coords
+        [x, y, z]
+      end
+
+      def ==(other)
+        return false unless other.is_a?(ProjectivePoint)
+        group == other.group && x == other.x && y == other.y && z == other.z
+      end
+    end
+  end
+end

data/lib/ecdsa/ext/version.rb

@@ -0,0 +1,7 @@
+# frozen_string_literal: true
+
+module ECDSA
+  module Ext
+    VERSION = "0.1.0"
+  end
+end

data/lib/ecdsa/ext.rb

@@ -0,0 +1,9 @@
+# frozen_string_literal: true
+require_relative "ext/version"
+module ECDSA
+  # Extension for ecdsa gem.
+  module Ext
+    autoload :PointArithmetic, "ecdsa/ext/point_arithmetic"
+    autoload :ProjectivePoint, "ecdsa/ext/projective_point"
+  end
+end

data/lib/ecdsa_ext.rb

@@ -0,0 +1,4 @@
+# frozen_string_literal: true
+
+require "ecdsa"
+require "ecdsa/ext"

data/sig/ecdsa_ext.rbs

@@ -0,0 +1,4 @@
+module EcdsaExt
+  VERSION: String
+  # See the writing guide of rbs: https://github.com/ruby/rbs#guides
+end

metadata

@@ -0,0 +1,80 @@
+--- !ruby/object:Gem::Specification
+name: ecdsa_ext
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- azuchi
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2023-02-25 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: ecdsa
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 1.2.0
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 1.2.0
+description: Extension of the ecdsa gem.
+email:
+- techmedia.think@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".prettierignore"
+- ".rspec"
+- ".rubocop.yml"
+- ".ruby-gemset"
+- ".ruby-version"
+- CHANGELOG.md
+- CODE_OF_CONDUCT.md
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- ecdsa_ext.gemspec
+- lib/ecdsa/ext.rb
+- lib/ecdsa/ext/point_arithmetic.rb
+- lib/ecdsa/ext/projective_point.rb
+- lib/ecdsa/ext/version.rb
+- lib/ecdsa_ext.rb
+- sig/ecdsa_ext.rbs
+homepage: https://github.com/azuchi/ruby_ecdsa_ext
+licenses:
+- MIT
+metadata:
+  homepage_uri: https://github.com/azuchi/ruby_ecdsa_ext
+  source_code_uri: https://github.com/azuchi/ruby_ecdsa_ext
+  changelog_uri: https://github.com/azuchi/ruby_ecdsa_ext
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 3.0.0
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.4.1
+signing_key: 
+specification_version: 4
+summary: Extension of the ecdsa gem.
+test_files: []