Diffie

本文介绍了Diffie-Hellman实现 - 帮助的处理方法，对大家解决问题具有一定的参考价值，需要的朋友们下面随着小编来一起学习吧！ 问题描述

大家好， 任何人都试图用c＃完成Diffie-Hellman的加密和解密。 有什么想法吗？ 现在我把它作为一个单独的win32 dll 并使用来自c＃的PInvoke .. 任何尝试过的人都完全用C＃.. 欢迎任何想法交流。 谢谢等待回复。 Badri

Hi guys, Anyone tried to do a Diffie-Hellman encryption and decryption totally in c#. Any ideas? Right now i do it as a separate win32 dll and use PInvoke from c#.. Anyone tried of doin that entirely in C#.. Any exchange of ideas is appreciated. Thanks and waiting for replies. Badri

推荐答案

Badri， 不知怎的，我觉得这不是正确的新闻组，但是你在这里...... 所以你已经有了一个dll，是你写的那个，还是其他人提供的？如果你写了它，那么它应该是一个直接的，虽然可能很长，但是使用C＃重写的任务。特别是因为它首先用C或C ++写的是 。 问候 Dave " ; Badri Mohan < BM **** @ NOSPAMuncc.edu>在消息中写道 news：eU ************** @ TK2MSFTNGP10.phx.gbl ... Badri, Somehow I think this is not the correct newsgroup, but while your here... So you already have a dll, is it one you wrote, or one someone else supplied? If you wrote it, then it should be a straight forward, although possibly lengthy, task to re-write using C#. Especially since it was probably written in C or C++ in the first place. Regards Dave "Badri Mohan" <bm****@NOSPAMuncc.edu> wrote in message news:eU**************@TK2MSFTNGP10.phx.gbl... 大家好，c＃中完成Diffie-Hellman加密和解密。任何想法？ 现在我把它作为一个单独的win32 dll 并使用来自c＃的PInvoke .. 任何尝试过的人都完全在C＃中... 欢迎任何想法的交流。感谢并等待回复。 Badri Hi guys, Anyone tried to do a Diffie-Hellman encryption and decryption totally in c#. Any ideas? Right now i do it as a separate win32 dll and use PInvoke from c#.. Anyone tried of doin that entirely in C#.. Any exchange of ideas is appreciated. Thanks and waiting for replies. Badri

Badri， 从数学的角度来看应该很容易。操作大的 整数可能是主要问题。 我知道两种解决方法。 a。使用Mono项目中的BigInteger类 （ http：// www .go-mono ）或它是CodeProject的祖先; b。使用Visual J中包含的Microsoft的bigInteger类＃ redist。 祝你好运！ - Sebastien Pouliot sp******@videotron.ca pages.infinit/ctech/poupou.html " Badri Mohan" < BM **** @ NOSPAMuncc.edu>在消息中写道 news：eU ************** @ TK2MSFTNGP10.phx.gbl ... Badri, It should be easy - from a mathematical point of view. Manipulating big integers is probably the main problem. I know two ways to solve it. a. Use the BigInteger class from the Mono project (www.go-mono) or it''s ancestor at CodeProject; b. Use the bigInteger class from Microsoft that is included in Visual J# redist. Good luck! -- Sebastien Pouliot sp******@videotron.ca pages.infinit/ctech/poupou.html "Badri Mohan" <bm****@NOSPAMuncc.edu> wrote in message news:eU**************@TK2MSFTNGP10.phx.gbl... 大家好，c＃中完成Diffie-Hellman加密和解密。任何想法？ 现在我把它作为一个单独的win32 dll 并使用来自c＃的PInvoke .. 任何尝试过的人都完全在C＃中... 欢迎任何想法的交流。感谢并等待回复。 Badri Hi guys, Anyone tried to do a Diffie-Hellman encryption and decryption totally in c#. Any ideas? Right now i do it as a separate win32 dll and use PInvoke from c#.. Anyone tried of doin that entirely in C#.. Any exchange of ideas is appreciated. Thanks and waiting for replies. Badri

" Badri Mohan" < BM **** @ NOSPAMuncc.edu>写了 "Badri Mohan" <bm****@NOSPAMuncc.edu> wrote 任何人都试图完全用 c＃进行Diffie-Hellman加密和解密。任何想法？现在我把它作为一个单独的win32 dll 并使用来自c＃的PInvoke .. 任何人都在尝试完全用C＃.. Anyone tried to do a Diffie-Hellman encryption and decryption totally in c#. Any ideas? Right now i do it as a separate win32 dll and use PInvoke from c#.. Anyone tried of doin that entirely in C#..

正如Sébastien所提到的，你可以使用Mono BigInteger类实现 。这正是我所做的，所以如果你对此感兴趣，那就是代码： www.mentalis/downloads/DH.zip 看起来效果很好但是我还没有测试它是否与其他Diffie Hellman实现兼容 。我认为是，但我想在我正式发布代码之前验证。如果您能为我验证这一点，我将不胜感激，因为您已经有了实施的DH 。我试着在CryptoAPI周围编写一个C＃包装器来验证我的托管代码，但是我遇到了一些问题。 问候， Pieter Philippaerts

As Sébastien mentioned, you can use the Mono BigInteger class to implement it. That''s exactly what I''ve done, so if you''re interested here''s the code: www.mentalis/downloads/DH.zip It appears to work perfectly but I haven''t tested whether it''s compatible with other Diffie Hellman implementations. I assume it is, but I''d like to verify that before I officially publish the code. I would appreciate it if you could verify this for me, since you already have a working DH implementation. I tried to write a C# wrapper around the CryptoAPI to verify my managed code, but I ran into some problems. Regards, Pieter Philippaerts