mirror of
https://gitclone.com/github.com/MetaCubeX/Clash.Meta
synced 2024-11-15 21:51:23 +08:00
98 lines
2.3 KiB
Go
98 lines
2.3 KiB
Go
package protocol
|
|
|
|
import (
|
|
"net"
|
|
"sort"
|
|
|
|
"github.com/metacubex/mihomo/transport/ssr/tools"
|
|
)
|
|
|
|
func init() {
|
|
register("auth_chain_b", newAuthChainB, 4)
|
|
}
|
|
|
|
type authChainB struct {
|
|
*authChainA
|
|
dataSizeList []int
|
|
dataSizeList2 []int
|
|
}
|
|
|
|
func newAuthChainB(b *Base) Protocol {
|
|
a := &authChainB{
|
|
authChainA: &authChainA{
|
|
Base: b,
|
|
authData: &authData{},
|
|
userData: &userData{},
|
|
salt: "auth_chain_b",
|
|
},
|
|
}
|
|
a.initUserData()
|
|
return a
|
|
}
|
|
|
|
func (a *authChainB) StreamConn(c net.Conn, iv []byte) net.Conn {
|
|
p := &authChainB{
|
|
authChainA: &authChainA{
|
|
Base: a.Base,
|
|
authData: a.next(),
|
|
userData: a.userData,
|
|
salt: a.salt,
|
|
packID: 1,
|
|
recvID: 1,
|
|
},
|
|
}
|
|
p.iv = iv
|
|
p.randDataLength = p.getRandLength
|
|
p.initDataSize()
|
|
return &Conn{Conn: c, Protocol: p}
|
|
}
|
|
|
|
func (a *authChainB) initDataSize() {
|
|
a.dataSizeList = a.dataSizeList[:0]
|
|
a.dataSizeList2 = a.dataSizeList2[:0]
|
|
|
|
a.randomServer.InitFromBin(a.Key)
|
|
length := a.randomServer.Next()%8 + 4
|
|
for ; length > 0; length-- {
|
|
a.dataSizeList = append(a.dataSizeList, int(a.randomServer.Next()%2340%2040%1440))
|
|
}
|
|
sort.Ints(a.dataSizeList)
|
|
|
|
length = a.randomServer.Next()%16 + 8
|
|
for ; length > 0; length-- {
|
|
a.dataSizeList2 = append(a.dataSizeList2, int(a.randomServer.Next()%2340%2040%1440))
|
|
}
|
|
sort.Ints(a.dataSizeList2)
|
|
}
|
|
|
|
func (a *authChainB) getRandLength(length int, lashHash []byte, random *tools.XorShift128Plus) int {
|
|
if length >= 1440 {
|
|
return 0
|
|
}
|
|
random.InitFromBinAndLength(lashHash, length)
|
|
pos := sort.Search(len(a.dataSizeList), func(i int) bool { return a.dataSizeList[i] >= length+a.Overhead })
|
|
finalPos := pos + int(random.Next()%uint64(len(a.dataSizeList)))
|
|
if finalPos < len(a.dataSizeList) {
|
|
return a.dataSizeList[finalPos] - length - a.Overhead
|
|
}
|
|
|
|
pos = sort.Search(len(a.dataSizeList2), func(i int) bool { return a.dataSizeList2[i] >= length+a.Overhead })
|
|
finalPos = pos + int(random.Next()%uint64(len(a.dataSizeList2)))
|
|
if finalPos < len(a.dataSizeList2) {
|
|
return a.dataSizeList2[finalPos] - length - a.Overhead
|
|
}
|
|
if finalPos < pos+len(a.dataSizeList2)-1 {
|
|
return 0
|
|
}
|
|
if length > 1300 {
|
|
return int(random.Next() % 31)
|
|
}
|
|
if length > 900 {
|
|
return int(random.Next() % 127)
|
|
}
|
|
if length > 400 {
|
|
return int(random.Next() % 521)
|
|
}
|
|
return int(random.Next() % 1021)
|
|
}
|