Is RSA algorithm secure if I have fixed message pool and an interceptor have also the message pool?












0















Suppose I have a fixed message pool of 1000 messages, person A is sending message from this fixed message pool to person B using RSA.
If an interceptor also have the message pool he can precompute all the encrypted messages using B's public key. Now if he intercept A's message can he surely tell which message A has sent to B?
In this case should we use RSA only for a symmetric key exchange and then messages should be encrypted using a symmetric algorithm?










share|improve this question


















  • 1





    Yes, provided you use it properly (by adding randomized padding to all your plaintext messages).

    – squeamish ossifrage
    Nov 22 '18 at 12:04











  • In this case why doesn't rsa use randomise padding to make the encryption more secure?

    – Habibullah Araphat
    Nov 22 '18 at 16:39











  • The premise of your question is false. Randomized padding is an essential part of the RSA algorithm.

    – squeamish ossifrage
    Nov 22 '18 at 17:04











  • Got it. Thanks.

    – Habibullah Araphat
    Nov 22 '18 at 17:54
















0















Suppose I have a fixed message pool of 1000 messages, person A is sending message from this fixed message pool to person B using RSA.
If an interceptor also have the message pool he can precompute all the encrypted messages using B's public key. Now if he intercept A's message can he surely tell which message A has sent to B?
In this case should we use RSA only for a symmetric key exchange and then messages should be encrypted using a symmetric algorithm?










share|improve this question


















  • 1





    Yes, provided you use it properly (by adding randomized padding to all your plaintext messages).

    – squeamish ossifrage
    Nov 22 '18 at 12:04











  • In this case why doesn't rsa use randomise padding to make the encryption more secure?

    – Habibullah Araphat
    Nov 22 '18 at 16:39











  • The premise of your question is false. Randomized padding is an essential part of the RSA algorithm.

    – squeamish ossifrage
    Nov 22 '18 at 17:04











  • Got it. Thanks.

    – Habibullah Araphat
    Nov 22 '18 at 17:54














0












0








0








Suppose I have a fixed message pool of 1000 messages, person A is sending message from this fixed message pool to person B using RSA.
If an interceptor also have the message pool he can precompute all the encrypted messages using B's public key. Now if he intercept A's message can he surely tell which message A has sent to B?
In this case should we use RSA only for a symmetric key exchange and then messages should be encrypted using a symmetric algorithm?










share|improve this question














Suppose I have a fixed message pool of 1000 messages, person A is sending message from this fixed message pool to person B using RSA.
If an interceptor also have the message pool he can precompute all the encrypted messages using B's public key. Now if he intercept A's message can he surely tell which message A has sent to B?
In this case should we use RSA only for a symmetric key exchange and then messages should be encrypted using a symmetric algorithm?







cryptography rsa






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked Nov 22 '18 at 10:41









Habibullah AraphatHabibullah Araphat

11




11








  • 1





    Yes, provided you use it properly (by adding randomized padding to all your plaintext messages).

    – squeamish ossifrage
    Nov 22 '18 at 12:04











  • In this case why doesn't rsa use randomise padding to make the encryption more secure?

    – Habibullah Araphat
    Nov 22 '18 at 16:39











  • The premise of your question is false. Randomized padding is an essential part of the RSA algorithm.

    – squeamish ossifrage
    Nov 22 '18 at 17:04











  • Got it. Thanks.

    – Habibullah Araphat
    Nov 22 '18 at 17:54














  • 1





    Yes, provided you use it properly (by adding randomized padding to all your plaintext messages).

    – squeamish ossifrage
    Nov 22 '18 at 12:04











  • In this case why doesn't rsa use randomise padding to make the encryption more secure?

    – Habibullah Araphat
    Nov 22 '18 at 16:39











  • The premise of your question is false. Randomized padding is an essential part of the RSA algorithm.

    – squeamish ossifrage
    Nov 22 '18 at 17:04











  • Got it. Thanks.

    – Habibullah Araphat
    Nov 22 '18 at 17:54








1




1





Yes, provided you use it properly (by adding randomized padding to all your plaintext messages).

– squeamish ossifrage
Nov 22 '18 at 12:04





Yes, provided you use it properly (by adding randomized padding to all your plaintext messages).

– squeamish ossifrage
Nov 22 '18 at 12:04













In this case why doesn't rsa use randomise padding to make the encryption more secure?

– Habibullah Araphat
Nov 22 '18 at 16:39





In this case why doesn't rsa use randomise padding to make the encryption more secure?

– Habibullah Araphat
Nov 22 '18 at 16:39













The premise of your question is false. Randomized padding is an essential part of the RSA algorithm.

– squeamish ossifrage
Nov 22 '18 at 17:04





The premise of your question is false. Randomized padding is an essential part of the RSA algorithm.

– squeamish ossifrage
Nov 22 '18 at 17:04













Got it. Thanks.

– Habibullah Araphat
Nov 22 '18 at 17:54





Got it. Thanks.

– Habibullah Araphat
Nov 22 '18 at 17:54












1 Answer
1






active

oldest

votes


















0














The text-book RSA encryption algorithm is deterministic. But the official RSA specifications (and also all implementations used in practice) include some (partly random) padding, so we don't actually encrypt plaintext, but pad(plaintext). So the above mentioned problem will not occur.



More details can be found in this answer https://stackoverflow.com/a/7933071/10690480






share|improve this answer























    Your Answer






    StackExchange.ifUsing("editor", function () {
    StackExchange.using("externalEditor", function () {
    StackExchange.using("snippets", function () {
    StackExchange.snippets.init();
    });
    });
    }, "code-snippets");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "1"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53429112%2fis-rsa-algorithm-secure-if-i-have-fixed-message-pool-and-an-interceptor-have-als%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    0














    The text-book RSA encryption algorithm is deterministic. But the official RSA specifications (and also all implementations used in practice) include some (partly random) padding, so we don't actually encrypt plaintext, but pad(plaintext). So the above mentioned problem will not occur.



    More details can be found in this answer https://stackoverflow.com/a/7933071/10690480






    share|improve this answer




























      0














      The text-book RSA encryption algorithm is deterministic. But the official RSA specifications (and also all implementations used in practice) include some (partly random) padding, so we don't actually encrypt plaintext, but pad(plaintext). So the above mentioned problem will not occur.



      More details can be found in this answer https://stackoverflow.com/a/7933071/10690480






      share|improve this answer


























        0












        0








        0







        The text-book RSA encryption algorithm is deterministic. But the official RSA specifications (and also all implementations used in practice) include some (partly random) padding, so we don't actually encrypt plaintext, but pad(plaintext). So the above mentioned problem will not occur.



        More details can be found in this answer https://stackoverflow.com/a/7933071/10690480






        share|improve this answer













        The text-book RSA encryption algorithm is deterministic. But the official RSA specifications (and also all implementations used in practice) include some (partly random) padding, so we don't actually encrypt plaintext, but pad(plaintext). So the above mentioned problem will not occur.



        More details can be found in this answer https://stackoverflow.com/a/7933071/10690480







        share|improve this answer












        share|improve this answer



        share|improve this answer










        answered Nov 22 '18 at 18:55









        Habibullah AraphatHabibullah Araphat

        11




        11
































            draft saved

            draft discarded




















































            Thanks for contributing an answer to Stack Overflow!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53429112%2fis-rsa-algorithm-secure-if-i-have-fixed-message-pool-and-an-interceptor-have-als%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            Popular posts from this blog

            Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

            Does disintegrating a polymorphed enemy still kill it after the 2018 errata?

            A Topological Invariant for $pi_3(U(n))$