@incollection{furht_rsa_2008,
	title = {{RSA} {Public}-{Key} {Encryption} {Algorithm}},
	copyright = {©2008 Springer-Verlag},
	isbn = {978-0-387-74724-8 978-0-387-78414-4},
	url = {http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_198},
	abstract = {DefinitionThe RSA is one of the popular public-key encryption algorithms.Rivest et al. published a method for obtaining digital signatures and public-key cryptosystems in 1978 [1]. In order to use the method, the encryption and decryption keys must be chosen as follows:1.Compute n as the product of two primes p and q: n = p × q. These two primes are very large and randomly selected primes. 2.Compute ϕ (n) = (p−1)(q−1). 3.Select e such that e is relatively prime to ϕ (n). 4.Select d such that e × d ≡ 1 mod (ϕ (n)), where stands for modular operation. 5.Choose (e, n) as the public key. 6.Choose (d, n) as the private key. In encryption and decryption, receiver's public key (eR, nR) and private key (dR, nR) are used. Encryption is carried out by using mc−meRmc−meRm\_c - m{\textasciicircum}\{e\_R \} mod nR, where m is the plaintext and mc is the ciphertext. Decryption is carried out by using m=(mc)dRm=(mc)dRm = {\textbackslash}left( \{m\_c \} {\textbackslash}right){\textasciicircum}\{{\textasciicircum}\{d\_R \} \} mod nR.For authentication, sender's public key (es, ns) and private key (d ...},
	language = {en},
	urldate = {2016-05-03},
	booktitle = {Encyclopedia of {Multimedia}},
	publisher = {Springer US},
	editor = {Furht, Borko},
	year = {2008},
	note = {00000},
	pages = {770--770}
}

{"_id":"LZRMTp4etMYe8DT5c","bibbaseid":"furht-rsapublickeyencryptionalgorithm-2008","authorIDs":[],"bibdata":{"bibtype":"incollection","type":"incollection","title":"RSA Public-Key Encryption Algorithm","copyright":"©2008 Springer-Verlag","isbn":"978-0-387-74724-8 978-0-387-78414-4","url":"http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_198","abstract":"DefinitionThe RSA is one of the popular public-key encryption algorithms.Rivest et al. published a method for obtaining digital signatures and public-key cryptosystems in 1978 [1]. In order to use the method, the encryption and decryption keys must be chosen as follows:1.Compute n as the product of two primes p and q: n = p × q. These two primes are very large and randomly selected primes. 2.Compute ϕ (n) = (p−1)(q−1). 3.Select e such that e is relatively prime to ϕ (n). 4.Select d such that e × d ≡ 1 mod (ϕ (n)), where stands for modular operation. 5.Choose (e, n) as the public key. 6.Choose (d, n) as the private key. In encryption and decryption, receiver's public key (eR, nR) and private key (dR, nR) are used. Encryption is carried out by using mc−meRmc−meRm_c - m\\textasciicircum\\e_R \\ mod nR, where m is the plaintext and mc is the ciphertext. Decryption is carried out by using m=(mc)dRm=(mc)dRm = \\textbackslashleft( \\m_c \\ \\textbackslashright)\\textasciicircum\\\\textasciicircum\\d_R \\ \\ mod nR.For authentication, sender's public key (es, ns) and private key (d ...","language":"en","urldate":"2016-05-03","booktitle":"Encyclopedia of Multimedia","publisher":"Springer US","editor":[{"propositions":[],"lastnames":["Furht"],"firstnames":["Borko"],"suffixes":[]}],"year":"2008","note":"00000","pages":"770–770","bibtex":"@incollection{furht_rsa_2008,\n\ttitle = {{RSA} {Public}-{Key} {Encryption} {Algorithm}},\n\tcopyright = {©2008 Springer-Verlag},\n\tisbn = {978-0-387-74724-8 978-0-387-78414-4},\n\turl = {http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_198},\n\tabstract = {DefinitionThe RSA is one of the popular public-key encryption algorithms.Rivest et al. published a method for obtaining digital signatures and public-key cryptosystems in 1978 [1]. In order to use the method, the encryption and decryption keys must be chosen as follows:1.Compute n as the product of two primes p and q: n = p × q. These two primes are very large and randomly selected primes. 2.Compute ϕ (n) = (p−1)(q−1). 3.Select e such that e is relatively prime to ϕ (n). 4.Select d such that e × d ≡ 1 mod (ϕ (n)), where stands for modular operation. 5.Choose (e, n) as the public key. 6.Choose (d, n) as the private key. In encryption and decryption, receiver's public key (eR, nR) and private key (dR, nR) are used. Encryption is carried out by using mc−meRmc−meRm\\_c - m{\\textasciicircum}\\{e\\_R \\} mod nR, where m is the plaintext and mc is the ciphertext. Decryption is carried out by using m=(mc)dRm=(mc)dRm = {\\textbackslash}left( \\{m\\_c \\} {\\textbackslash}right){\\textasciicircum}\\{{\\textasciicircum}\\{d\\_R \\} \\} mod nR.For authentication, sender's public key (es, ns) and private key (d ...},\n\tlanguage = {en},\n\turldate = {2016-05-03},\n\tbooktitle = {Encyclopedia of {Multimedia}},\n\tpublisher = {Springer US},\n\teditor = {Furht, Borko},\n\tyear = {2008},\n\tnote = {00000},\n\tpages = {770--770}\n}\n\n","editor_short":["Furht, B."],"key":"furht_rsa_2008","id":"furht_rsa_2008","bibbaseid":"furht-rsapublickeyencryptionalgorithm-2008","role":"editor","urls":{"Paper":"http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_198"},"downloads":0,"html":""},"bibtype":"incollection","biburl":"http://www.telemidia.puc-rio.br/~alan/files/all.bib","creationDate":"2020-03-03T14:08:14.144Z","downloads":0,"keywords":[],"search_terms":["rsa","public","key","encryption","algorithm"],"title":"RSA Public-Key Encryption Algorithm","year":2008,"dataSources":["jAxurbvLP8q5LTdLa"]}