# Why is confusion and diffusion never talked about in asymmetric crypto?

While talking about symmetric encryption schemes like AES we always have a goal of achieving confusion and diffusion. But when it comes to asymmetric encryption schemes like RSA, DH etc. we never talk about diffusion and confusion.

Is it known that modular arithmetic and prime arithmetic ensure confusion and diffusion?

Is there any literature that dives into the information theoretic analysis, in terms of confusion and diffusion, for RSA?

• Maybe not exactly a dupe, however, there are some answers about this in Why is public-key encryption so much less efficient than secret-key encryption? (Samul Neves's answer..) Nov 9 '21 at 13:20
• That answer explains the difference between RSA and symmetric encryption but doesn't really explain why confusion and diffusion is not needed for asymmetric crypto. Thank you for the reference, now i know why AES is much more efficient Nov 9 '21 at 13:30
• Because the lie in relies on the existence of trapdoor functions. Different design requires different anaylzes. Nov 9 '21 at 13:36

• This answer missing answering the theoretical connection between the confusion&diffusion and hard predicates. Shannon 1941 page 708, In the method of diffusion the statistical structure of M which leads to its redundancy is “dissipated” into long-range statistics—i.e., into statistical structure involving long combinations of letters in the cryptogram. and later confusion... Nov 9 '21 at 20:15