0
$\begingroup$

The four Public-key cryptosystems: RSA, ElGamel, DH, and Rabin (all with others) all require some group operations in an integer field or multiplication group of some residue classes. When it comes to encrypting blocks of bits in binary how are these public key cryptosystems performed ? Are byte blocks just converted to base 10 and the encryption is perform on each byte? However results of RSA are much longer than a byte each.

$\endgroup$
0
$\begingroup$

They are used to encrypt symmetric keys. ​ No.

| improve this answer | |
$\endgroup$
  • $\begingroup$ The symmetric key is obviously encoded in someway, probably hex or binary, so how are these public key operations performed on something in that format, the examples I see are on base 10 only? Is it just left in hex or binary? $\endgroup$ – dylan7 Jul 9 '15 at 0:27
  • $\begingroup$ @dylan7 hex, binary, and decimal are all just different ways of viewing the same number, the key is treated as a series of bits, and the mathematical operations are performed on those bits $\endgroup$ – Richie Frame Jul 9 '15 at 1:02

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.