You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

63 lines
2.1 KiB

  1. // Copyright 2017-2018 DERO Project. All rights reserved.
  2. // Use of this source code in any form is governed by RESEARCH license.
  3. // license can be found in the LICENSE file.
  4. // GPG: 0F39 E425 8C65 3947 702A 8234 08B2 0360 A03A 9DE8
  5. //
  6. //
  7. // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
  8. // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
  9. // MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
  10. // THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  11. // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
  12. // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  13. // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  14. // STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
  15. // THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  16. package ringct
  17. import "encoding/hex"
  18. import "github.com/arnaucode/derosuite/crypto"
  19. // convert a hex string to a key
  20. // a copy of these functions exists in the crypto package also
  21. func HexToKey(h string) (result Key) {
  22. byteSlice, _ := hex.DecodeString(h)
  23. if len(byteSlice) != 32 {
  24. panic("Incorrect key size")
  25. }
  26. copy(result[:], byteSlice)
  27. return
  28. }
  29. func HexToHash(h string) (result crypto.Hash) {
  30. byteSlice, _ := hex.DecodeString(h)
  31. if len(byteSlice) != 32 {
  32. panic("Incorrect key size")
  33. }
  34. copy(result[:], byteSlice)
  35. return
  36. }
  37. // zero fill the key
  38. func Sc_0(k *Key) {
  39. for i := 0; i < 32; i++ {
  40. k[i] = 0
  41. }
  42. }
  43. // RandomPubKey takes a random scalar, interprets it as a point on the curve
  44. // and then multiplies by 8 to make it a point in the Group
  45. // remember the low order bug and do more auditing of the entire thing
  46. func RandomPubKey() (result *Key) {
  47. result = new(Key)
  48. p3 := new(ExtendedGroupElement)
  49. var p1 ProjectiveGroupElement
  50. var p2 CompletedGroupElement
  51. h := RandomScalar()
  52. p1.FromBytes(h)
  53. GeMul8(&p2, &p1)
  54. p2.ToExtended(p3)
  55. p3.ToBytes(result)
  56. return
  57. }