Glossary entry (derived from question below)
English term or phrase:
exponentiated to
Japanese translation:
(eの)累乗
Added to glossary by
Minoru Kuwahara
Jul 26, 2006 08:02
17 yrs ago
English term
Japan
Native in: Japanese
Works in: English to Japanese, French to Japanese, Japanese to English
exponentiated to
English to Japanese
Science
Mathematics & Statistics
security algorism, 暗号
The message may be exponentiated to each of the relatively small divisors and the result checked for the group identity.
-----
通信セキュリティの Small-Subgroup Attack Prevention に関する文脈で、かなり高度に数学的な内容が出てきます。ここで知りたいのは exponentiated to each of the relatively small divisors というところの解釈なのですが、ご意見をお聞かせいただけませんでしょうか。
よろしくお願いします。
-----
通信セキュリティの Small-Subgroup Attack Prevention に関する文脈で、かなり高度に数学的な内容が出てきます。ここで知りたいのは exponentiated to each of the relatively small divisors というところの解釈なのですが、ご意見をお聞かせいただけませんでしょうか。
よろしくお願いします。
Proposed translations
17 hrs
English term (edited):
exponentiated to (e)
Selected
(eの)累乗
I believe this is describing a method of encrypting messages. Many public-key encryption methods exponentiate (raise to a power) the message during encryption.
It's important to realize that the message is being rendered as a number. (For example, concatenating ASCII values of the characters in the message.) It does not make sense to exponentiate normal words or letters.
For example, RSA encryption may be described as:
c: encrypted message
m: unencrypted message
e: encryption exponent
n: encryption modulus (part of the public key)
c = (m^e) mod n
I've attached web refrences for a description of RSA encryption. I'm not sure if it's similar to the encryption being used in your source, but it is a fairly common method.
It's important to realize that the message is being rendered as a number. (For example, concatenating ASCII values of the characters in the message.) It does not make sense to exponentiate normal words or letters.
For example, RSA encryption may be described as:
c: encrypted message
m: unencrypted message
e: encryption exponent
n: encryption modulus (part of the public key)
c = (m^e) mod n
I've attached web refrences for a description of RSA encryption. I'm not sure if it's similar to the encryption being used in your source, but it is a fairly common method.
4 KudoZ points awarded for this answer.
Comment: "Not hearing from you, but ok, I highly appreciate your clarification about this. Helps much! Thanks.
Minoru Kuwahara"
Discussion
US Patents 5,933,504 & 6,563,928; Strengthened public key protocol
A cryptosystem utilizes the properties of discrete logs in finite groups, either in a public key message exchange or in a key exchange and generation protocol. If the group selected has subgroups of relatively small order, the message may be exponentiated by a factor of the order of the group to place the message in a subgroup of relatively small order. To inhibit such substitution, the base or generator of the cryptosystem is chosen to be a generator of a subgroup of prime order or a subgroup of an order having a number of relatively small divisors. The message may be exponentiated to each of the relatively small divisors and the result checked for the group identity. If the group identity is found, it indicates a vulnerability to substitution and is rejected.