Editing Probabilistic encryption (section)

{{Short description|Use of randomness in key code generation}}
'''Probabilistic encryption''' is the use of [[randomness]] in an [[encryption]] algorithm, so that when encrypting the same message several times it will, in general, yield different [[ciphertext]]s.  The term "probabilistic encryption" is typically used in reference to [[public key cryptography|public key]] encryption algorithms; however various [[symmetric key encryption]] algorithms achieve a similar property (e.g., [[block ciphers]] when used in a chaining mode such as [[Cipher block chaining|CBC]]), and stream ciphers such as Freestyle<ref>{{Cite journal|last=Puthuparambil|first=Arun Babu|last2=Thomas|first2=Jithin Jose|date=2019-12-01|title=Freestyle, a randomized version of ChaCha for resisting offline brute-force and dictionary attacks|journal=Journal of Information Security and Applications|language=en|volume=49|pages=102396|doi=10.1016/j.jisa.2019.102396|arxiv=1802.03201|issn=2214-2126}}</ref> which are inherently random.  To be [[semantic security|semantically secure]], that is, to hide even partial information about the [[plaintext]], an encryption algorithm must be [[randomized algorithm|probabilistic]].