You are on page 1of 1

CCA RSA Example

Take advantage of the multiplicative property of RSA Let C1 M1e mod n and C! M!e mod n then C1C! "M1M!#e mod n $e can decrypt C Me mod n u%ing a CCA a% follo&%' 1( )enerate a %ecret random r from Zn* !( Compute C Cre mod n +( Su,mit C a% a cho%en ciphertext and receive ,ack M C d mod n = Mr Since C "C mod n# x "re mod n# "Me mod n# x "re mod n# "Mr#e mod n -( .educe M &ith a divi%ion modulo n %ince r i% kno&n /1 "i(e( "Mr# r mod n# TAC2681 Applied Cryptography

You might also like