椭圆曲线密码学对网络编码员的挑战.... [英] Challenge For The Network Coders about elliptic curve cryptography....

问题描述

嗨 1.我想知道如何找到生成点的顺序?我的意思是编程时可以使用无穷大的约定，以便我可以找到生成点.

2.使用koblitz方法对文本消息进行编码时，x-y坐标的值是否有界限?或者它可以是满足方程y^2%p=x^3+ax+b %p
的任何值吗?
3.在短信编码中使用k的值查找x-y坐标(koblitz方法)是否与发件人随机生成的用于加密消息的值相同?或两者都不同?k的值应小于p(字段数)的值吗?


已经过了一个星期，我们正在搜索 plz快速回复...

Hi 1.i want to know how can i find the order of the generating point?i mean what can be the convention used for infinity while programming so that i can find generating point.

2.Is there any bound for the values of x-y coordinates while encoding the text message using koblitz method?or can it be any value which does satisfy the equation y^2%p=x^3+ax+b %p

3.Is the value of k used during encoding of text message to find x-y coordinates(koblitz method) is same as the value randomely generated by the sender to encrypt the message? or both are different?and should the value of k be less than value of p(number of fields)


its been a week we are searching plz reply fast...

推荐答案

此处有有关CodeProject的文章:椭圆曲线密码术的简单C ++实现 [

There''s an article on CodeProject here: A simple C++ implementation of Elliptic Curve Cryptography[^]

Google returns many results. Please let us know which ones you''ve looked at, so we don''t duplicate those results.

这篇关于椭圆曲线密码学对网络编码员的挑战....的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！