RSA and elliptic curve least significant bit security

RSA and elliptic curve least significant bit security (2015)

Authors:
- Nakamura, Dionathan
- Terada, Routo
Autor USP: TERADA, ROUTO - IME
Unidade: IME
DOI: 10.1007/978-3-319-16295-9_8
Assunto: CRIPTOLOGIA
Keywords: RSA; elliptic curve; Diffie-Hellman; least significant bit; Oracle Integer factorization; discrete log problem
Language: Inglês
Imprenta:
- Publisher: Springer
- Publisher place: Cham
- Date published: 2015
Source:
- Título: Progress in Cryptology - LATINCRYPT 2014
Conference titles: International Conference on Cryptology and Information Security in Latin America - LATINCRYPT

Informações sobre o DOI: 10.1007/978-3-319-16295-9_8 (Fonte: oaDOI API)

A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

ABNT

NAKAMURA, Dionathan e TERADA, Routo. RSA and elliptic curve least significant bit security. 2015, Anais.. Cham: Springer, 2015. Disponível em: https://doi.org/10.1007/978-3-319-16295-9_8. Acesso em: 14 fev. 2026.
APA

Nakamura, D., & Terada, R. (2015). RSA and elliptic curve least significant bit security. In Progress in Cryptology - LATINCRYPT 2014. Cham: Springer. doi:10.1007/978-3-319-16295-9_8
NLM

Nakamura D, Terada R. RSA and elliptic curve least significant bit security [Internet]. Progress in Cryptology - LATINCRYPT 2014. 2015 ;[citado 2026 fev. 14 ] Available from: https://doi.org/10.1007/978-3-319-16295-9_8
Vancouver

Nakamura D, Terada R. RSA and elliptic curve least significant bit security [Internet]. Progress in Cryptology - LATINCRYPT 2014. 2015 ;[citado 2026 fev. 14 ] Available from: https://doi.org/10.1007/978-3-319-16295-9_8