mirror of
https://github.com/Luzifer/cloudkeys-go.git
synced 2024-11-14 00:42:44 +00:00
Knut Ahlers
a1df72edc5
commitf0db1ff1f8Author: Knut Ahlers <knut@ahlers.me> Date: Sun Dec 24 12:19:56 2017 +0100 Mark option as deprecated Signed-off-by: Knut Ahlers <knut@ahlers.me> commit9891df2a16Author: Knut Ahlers <knut@ahlers.me> Date: Sun Dec 24 12:11:56 2017 +0100 Fix: Typo Signed-off-by: Knut Ahlers <knut@ahlers.me> commit836006de64Author: Knut Ahlers <knut@ahlers.me> Date: Sun Dec 24 12:04:20 2017 +0100 Add new dependencies Signed-off-by: Knut Ahlers <knut@ahlers.me> commitd64fee60c8Author: Knut Ahlers <knut@ahlers.me> Date: Sun Dec 24 11:55:52 2017 +0100 Replace insecure password hashing Prior this commit passwords were hashed with a static salt and using the SHA1 hashing function. This could lead to passwords being attackable in case someone gets access to the raw data stored inside the database. This commit introduces password hashing using bcrypt hashing function which addresses this issue. Old passwords are not automatically re-hashed as they are unknown. Replacing the old password scheme is not that easy and needs #10 to be solved. Therefore the old hashing scheme is kept for compatibility reason. Signed-off-by: Knut Ahlers <knut@ahlers.me> Signed-off-by: Knut Ahlers <knut@ahlers.me> closes #14 closes #15
43 lines
1.1 KiB
Go
43 lines
1.1 KiB
Go
// Copyright 2012 The Go Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
package bn256
|
|
|
|
import (
|
|
"crypto/rand"
|
|
)
|
|
|
|
func ExamplePair() {
|
|
// This implements the tripartite Diffie-Hellman algorithm from "A One
|
|
// Round Protocol for Tripartite Diffie-Hellman", A. Joux.
|
|
// http://www.springerlink.com/content/cddc57yyva0hburb/fulltext.pdf
|
|
|
|
// Each of three parties, a, b and c, generate a private value.
|
|
a, _ := rand.Int(rand.Reader, Order)
|
|
b, _ := rand.Int(rand.Reader, Order)
|
|
c, _ := rand.Int(rand.Reader, Order)
|
|
|
|
// Then each party calculates g₁ and g₂ times their private value.
|
|
pa := new(G1).ScalarBaseMult(a)
|
|
qa := new(G2).ScalarBaseMult(a)
|
|
|
|
pb := new(G1).ScalarBaseMult(b)
|
|
qb := new(G2).ScalarBaseMult(b)
|
|
|
|
pc := new(G1).ScalarBaseMult(c)
|
|
qc := new(G2).ScalarBaseMult(c)
|
|
|
|
// Now each party exchanges its public values with the other two and
|
|
// all parties can calculate the shared key.
|
|
k1 := Pair(pb, qc)
|
|
k1.ScalarMult(k1, a)
|
|
|
|
k2 := Pair(pc, qa)
|
|
k2.ScalarMult(k2, b)
|
|
|
|
k3 := Pair(pa, qb)
|
|
k3.ScalarMult(k3, c)
|
|
|
|
// k1, k2 and k3 will all be equal.
|
|
}
|