The question says how prime numbers or quadratic congruence can
be used to crack the encryption system. As prime numbers in
nowadays have the most usual type of encryption in the market that
uses the RSA algorithm that was named after three
mathematicians.
- This RX algorithm allows the message to get encrypted without
knowing the sender about the keys and security services. First,
after selecting two prime numbers it's multiplied to get 187. The
second number is the smallest one. As the product of two always
comes out to be unique that is called semi prime which is
multiplied to obtain them that is never divisible by composite
number. The address encryption mathematically evaluates, suppose it
too mechanically performs things more complex and can be shared
openly because someone who is having multiplicands in hand cannot
work out what the second one is. Also, these algorithms using
techniques and precision helps out to crack the entire encryption
system.
*Please give an upvote if you find this solution
helpful.