解密加密的连接字符串 [英] Decrypt the encrypted connection string

问题描述

大家好，

我在加密的配置文件中有以下代码:

< connectionstrings configprotectionprovider ="RsaProtectedConfigurationProvider">
< encrypteddata type ="http://www.w3.org/2001/04/xmlenc#Element">
xmlns ="http://www.w3.org/2001/04/xmlenc#">
< encryptionmethod algorithm ="http://www.w3.org/2001/04/xmlenc#tripledes-cbc">
< keyinfo xmlns ="http://www.w3.org/2000/09/xmldsig#">
< encryptedkey xmlns ="http://www.w3.org/2001/04/xmlenc#">
< encryptionmethod algorithm ="http://www.w3.org/2001/04/xmlenc#rsa-1_5">
< keyinfo xmlns ="http://www.w3.org/2000/09/xmldsig#">
< keyname> Rsa密钥

< cipherdata>
<密码值> G7PVGIQ5088SpJ9Z14NRx59DBxSXDVvWyRWE7X6Msb48T9zT3gNizWnzpWIvDrmSY3 + o58 =



< cipherdata>
<密码值> L5ON3uqf8Y1y3SgEmpkR + aoeQFe1OIaieOVuaOqtC1JpQkz4g9hgnjbdxiMvcFEGVUijP01xeQ =




我需要解密.请提出解决方案.

感谢

Hi All,

I have the below code in config file which is encrypted:

<connectionstrings configprotectionprovider="RsaProtectedConfigurationProvider">
<encrypteddata type="http://www.w3.org/2001/04/xmlenc#Element">
xmlns="http://www.w3.org/2001/04/xmlenc#">
<encryptionmethod algorithm="http://www.w3.org/2001/04/xmlenc#tripledes-cbc">
<keyinfo xmlns="http://www.w3.org/2000/09/xmldsig#">
<encryptedkey xmlns="http://www.w3.org/2001/04/xmlenc#">
<encryptionmethod algorithm="http://www.w3.org/2001/04/xmlenc#rsa-1_5">
<keyinfo xmlns="http://www.w3.org/2000/09/xmldsig#">
<keyname>Rsa Key

<cipherdata>
<ciphervalue>G7PVGIQ5088SpJ9Z14NRx59DBxSXDVvWyRWE7X6Msb48T9zT3gNizWnzpWIvDrmSY3+o58=



<cipherdata>
<ciphervalue>L5ON3uqf8Y1y3SgEmpkR+aoeQFe1OIaieOVuaOqtC1JpQkz4g9hgnjbdxiMvcFEGVUijP01xeQ=




I need to decrypt this.Please suggest solution.

Thanks

推荐答案

要让数学家最普遍的信念，就是公钥密码学的专家，只有加密才能使任何人都无法解密任何数据密钥是已知的，如果只有解密密钥，则任何人都无法修改加密的数据.如果已知密钥对中的另一个密钥，则不可行.公钥加密的整个思想都基于这些功能.

实际上，这还没有得到充分的证明，但这是一个重要的猜想，它表明存在单向函数，即，一个不可行求逆的函数和后门不存在.专家们普遍认为，现代的公钥加密算法是单向功能的候选者，并且该特性迟早会得到证明.

有关更多信息，请参见:
http://en.wikipedia.org/wiki/One-way_function [ http://en.wikipedia.org/wiki/Backdoor_%28computing%29 [ ^ ]，
http://en.wikipedia.org/wiki/Public-key_cryptography [ http://en.wikipedia.org/wiki/RSA_%28algorithm%29 [ ^ ].

—SA

To the most common believe of the mathematicians, experts in public-key cryptography, nobody can decrypt any data if only the encryption key is known, and nobody can modify encrypted data if only the decryption key is known. It is equally infeasible to find one key if another key in the pair is known. The whole idea of the public-key cryptography is based on these features.

In fact, this is not strongly proven, but this is the important conjecture which states that a one-way function exists, that is, a function which is not feasible to invert, and the backdoor does not exist. It''s commonly believed by the specialists, that the modern public-key cryptography algorithms are the candidates for the one-way functions and that property will be proven sooner or later.

For further information, please see:
http://en.wikipedia.org/wiki/One-way_function[^],
http://en.wikipedia.org/wiki/Backdoor_%28computing%29[^],
http://en.wikipedia.org/wiki/Public-key_cryptography[^],
http://en.wikipedia.org/wiki/RSA_%28algorithm%29[^].

—SA

这篇关于解密加密的连接字符串的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！