2014-07-15 12:06
浏览 311


I'm trying to create an RSA Public Key from a Modulus and Exponent stored in a byte array. After some experimentation I've got the following:

func bytes_to_int(b []byte) (acc uint64) {
  length := len(b)
  if length % 4 != 0 {
    extra := (4 - length % 4)
    b = append([]byte(strings.Repeat("\000", extra)), b...)
    length += extra
  var block uint32
  for i := 0; i < length; i += 4 {
    block = binary.BigEndian.Uint32(b[i:i+4])
    acc = (acc << 32) + uint64(block)

func main() {

This appears to work (although I'm not convinced there isn't a better way). My next step was to convert it to use math/big in order to handle larger numbers. I can see an Lsh function to do the << but can't figure out how to recursively add the Uint32(block) to the big.Int.

For reference, the Public Key I'm attempting to import is a Mixmaster Key stored in a keyring (pubring.mix):

  • 点赞
  • 写回答
  • 关注问题
  • 收藏
  • 邀请回答

3条回答 默认 最新

  • douyi9787
    douyi9787 2014-07-15 12:25

    You want Int.SetBytes to make a from a slice of []byte.

    func (z *Int) SetBytes(buf []byte) *Int

    SetBytes interprets buf as the bytes of a big-endian unsigned integer, sets z to that value, and returns z.

    This should be quite straightforward to use in your application since your keys are in big-endian format according to the doc you linked.

    点赞 评论
  • douduan1953
    douduan1953 2014-07-15 12:32

    Like Nick mentioned, you could use SetBytes, keep in mind the input is in base64 so you have to decode that first.


    func Base64ToInt(s string) (*big.Int, error) {
        data, err := base64.StdEncoding.DecodeString(s)
        if err != nil {
            return nil, err
        i := new(big.Int)
        return i, nil
    点赞 评论
  • dousui4577
    dousui4577 2016-04-29 17:32
    import "math/big"
    z := new(big.Int)
    点赞 评论