java - RSA keypair "diversification"? -
symmetric keys (aes, 3des, ...) can diversified specified diversification input. done way:
divkey = enc[plaintext = key, iv = divinput, k = key] however, based on fact each 16-byte array valid aes key.
is there way similar whole rsa keypairs? provide different rsa private key each of "clients", keep 1 rsa public key able verify signatures. if there diversification algorithm whole rsa keypairs, give clients "diversified" private key , keep original public key verify signatures. important me, because need store public key in device limited persistent memory.
is there such algorithm? if yes, there java libary implementing it?
maybe obvious such diversification algorithm cannot exist, not know.
if think question should moved cryptoexchange, so, please.
this kind of thing hard generate rsa. public key cannot created separately private key. private key have generated other private key there isn't clear mathematical connection between master private key material , generated one.
not needed. can generate key pair on client. send certificate request client server. server return certificate signed private key of trusted certificate. if client wants connect send certificate. server verify signed trusted certificate. after has trusted public key of client.
in other words, read x509 based pki understand why such key derivation method not required.
Comments
Post a Comment