id: Гость   вход   регистрация
текущее время 23:43 20/09/2020
Автор темы: Rabby, тема открыта 08/06/2006 12:39 ПечатьФорум/ПрактическаяБезопасность/НадежноЛиШифрованиеВMirandeПриПомощиSecureIM

Надежно ли шифрование в Mirand'e при помощи Secure IM?

Продолжу тему. Начало см. на

где я спрашивал у всех присутствующих, надежно ли шифрование в Mirand'e при помощи Secure IM. Получив ответ от САТТВы и не дожидаясь ответа от автора плагина, я просмотрел 7 или 8 страниц обсуждения на соответствующем форуме:

Так вот, один из посетителей так прямо и спрашивает автора: "Несекретно?"

What do you think about this post? P=59873#post59873
Is p not a prime and is it insecure if so?

Указанная выше ссылка ведет на интересное обсуждение, косвенно подтверждающее то, о чем уже говорил САТТВА, когда давал свою оценку плагину. Там же дана еще одна ссылка – на лабораторию RSA:

The Diffie-Hellman key agreement protocol (also called exponential key agreement) was developed by Diffie and Hellman [DH76] in 1976 and published in the ground-breaking paper "New Directions in Cryptography." The protocol allows two users to exchange a secret key over an insecure medium without any prior secrets.

**The protocol has two system parameters p and g. They are both public and may be used by all the users in a system. Parameter p is a prime number and parameter g (usually called a generator) is an integer less than p, with the following property: for every number n between 1 and p-1 inclusive, there is a power k of g such that n = gk mod p.

Suppose Alice and Bob want to agree on a shared secret key using the Diffie-Hellman key agreement protocol. They proceed as follows: First, Alice generates a random private value a and Bob generates a random private value b. Both a and b are drawn from the set of integers. Then they derive their public values using parameters p and g and their private values. Alice's public value is ga mod p and Bob's public value is gb mod p. They then exchange their public values. Finally, Alice computes gab = (gb) a mod p, and Bob computes gba = (ga) b mod p. Since gab = gba = k, Alice and Bob now have a shared secret key k.**

The protocol depends on the discrete logarithm problem for its security. It assumes that it is computationally infeasible to calculate the shared secret key k = gab mod p given the two public values ga mod p and gb mod p when the prime p is sufficiently large. Maurer [Mau94] has shown that breaking the Diffie-Hellman protocol is equivalent to computing discrete logarithms under certain assumptions.

The Diffie-Hellman key exchange is vulnerable to a man-in-the-middle attack. In this attack, an opponent Carol intercepts Alice's public value and sends her own public value to Bob. When Bob transmits his public value, Carol substitutes it with her own and sends it to Alice. Carol and Alice thus agree on one shared key and Carol and Bob agree on another shared key. After this exchange, Carol simply decrypts any messages sent out by Alice or Bob, and then reads and possibly modifies them before re-encrypting with the appropriate key and transmitting them to the other party. This vulnerability is present because Diffie-Hellman key exchange does not authenticate the participants. Possible solutions include the use of digital signatures and other protocol variants.

The authenticated Diffie-Hellman key agreement protocol, or Station-to-Station (STS) protocol, was developed by Diffie, van Oorschot, and Wiener in 1992 [DVW92] to defeat the man-in-the-middle attack on the Diffie-Hellman key agreement protocol. The immunity is achieved by allowing the two parties to authenticate themselves to each other by the use of digital signatures (see Question 2.2.2) and public-key certificates (see Question

Roughly speaking, the basic idea is as follows. Prior to execution of the protocol, the two parties Alice and Bob each obtain a public/private key pair and a certificate for the public key. During the protocol, Alice computes a signature on certain messages, covering the public value ga mod p. Bob proceeds in a similar way. Even though Carol is still able to intercept messages between Alice and Bob, she cannot forge signatures without Alice's private key and Bob's private key. Hence, the enhanced protocol defeats the man-in-the-middle attack.

In recent years, the original Diffie-Hellman protocol has been understood to be an example of a much more general cryptographic technique, the common element being the derivation of a shared secret value (that is, key) from one party's public key and another party's private key. The parties' key pairs may be generated anew at each run of the protocol, as in the original Diffie-Hellman protocol. The public keys may be certified, so that the parties can be authenticated and there may be a combination of these attributes. The draft ANSI X9.42 (see Question 5.3.1) illustrates some of these combinations, and a recent paper by Blake-Wilson, Johnson, and Menezes provides some relevant security proofs.

Прошу прощения за обилие цитат вообще, а англоязычных – в частности!

Так вот, автор плагина также прямо :D отвечает на вопрос:

**it's a true :-(
i can change "p", but we would loose previous version compatibility...**

— SATtva (11/06/2006 11:49)   профиль/связь   <#>
комментариев: 11552   документов: 1036   редакций: 4094
i can change "p", but we would loose previous version compatibility...

Как обычно, функциональность в ущерб в безопасности. Если такое мы слышим от авторов программ обеспечения секретности, что стоит ожидать от остальных? Никто не читает "Секреты и ложь" Шнайера?
Ваша оценка документа [показать результаты]
-3-2-1 0+1+2+3