On sufficient randomness for secure public-key cryptosystems

研究成果: Conference contribution

3 引用 (Scopus)

抜粋

In this paper, we consider what condition is sufficient for random inputs to secure probabilistic public-key encryption schemes. Although a framework given in [16] enables us to discuss uniformly and comprehensively security notions of public-key encryption schemes even for the case where cryptographically weak pseudorandom generator is used as random nonce generator to encrypt single plaintext messages, the results are rather theoretical. Here we naturally generalize the framework in order to handle security for the situation where we want to encrypt many messages with the same key. We extend some results w.r.t. single message security in [16] – separation results between security notions and a non-trivial sufficient condition for the equivalence between security notions – to multiple messages security. Besides the generalization, we show another separation between security notions for k-tuple messages and for (k+1)-tuple messages. The natural generalization, obtained here, rather improves to understand the security of public-key encryption schemes and eases the discussion of the security of practical public-key encryption schemes. In other words, the framework contributes to elucidating the role of randomness in public-key encryption scheme. As application of results in the generalized framework, we consider compatibility between the ElGamal encryption scheme and some sequence generators. Especially, we consider the applicability of the linear congruential generator (LCG) to the ElGamal encryption scheme.

元の言語English
ホスト出版物のタイトルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
出版者Springer Verlag
ページ34-47
ページ数14
2274
ISBN(印刷物)3540431683, 9783540431688
DOI
出版物ステータスPublished - 2002
外部発表Yes
イベント5th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2002 - Paris, France
継続期間: 2002 2 122002 2 14

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2274
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

Other

Other5th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2002
France
Paris
期間02/2/1202/2/14

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント On sufficient randomness for secure public-key cryptosystems' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Koshiba, T. (2002). On sufficient randomness for secure public-key cryptosystems. : Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (巻 2274, pp. 34-47). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 2274). Springer Verlag. https://doi.org/10.1007/3-540-45664-3_3