Non-matching values for modulus and p*q in RSA encryption

Non-matching values for modulus and p*q in RSA encryption

回答

The problem is that reversing the arrays is not enough. Because they are unsigned they also require padding depending on the value at the end of the array.

If the value at the end of the array is >= 128 the high bit of that value is set and the byte[] constructor for BigInteger interprets this as a negative sign. Tacking on a 0 in this case prevents this.

public static BigInteger FromBigEndian(byte[] p)
{
    var q = p.Reverse();
    return new BigInteger((p[0] < 128 ? q : q.Concat(new byte[] { 0 })).ToArray());
}

Convert parameters as follows instead

byte[] p = rsaparams.P;
BigInteger primeP = FromBigEndian(p);

 

作者:Chuck Lu    GitHub    
posted @   ChuckLu  阅读(13)  评论(0编辑  收藏  举报
编辑推荐:
· 记一次.NET内存居高不下排查解决与启示
· 探究高空视频全景AR技术的实现原理
· 理解Rust引用及其生命周期标识(上)
· 浏览器原生「磁吸」效果!Anchor Positioning 锚点定位神器解析
· 没有源码,如何修改代码逻辑?
阅读排行:
· 全程不用写代码,我用AI程序员写了一个飞机大战
· DeepSeek 开源周回顾「GitHub 热点速览」
· MongoDB 8.0这个新功能碉堡了,比商业数据库还牛
· 记一次.NET内存居高不下排查解决与启示
· 白话解读 Dapr 1.15:你的「微服务管家」又秀新绝活了
历史上的今天:
2020-12-14 Regex plus vs star difference?
2017-12-14 remote debug
2017-12-14 客户端通过wcf来启动或者停止服务器上的windows service
点击右上角即可分享
微信分享提示