ReP USP - Resultado da busca

Artigo de periodico
Faster constant-time decoder for MDPC codes and applications to BIKE KEM (2022)
Paiva, Thales Bandiera ; Terada, Routo
Fonte: IACR Transactions on Cryptographic Hardware and Embedded Systems. Unidade: IME
Assunto: CRIPTOLOGIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PAIVA, Thales Bandiera e TERADA, Routo. Faster constant-time decoder for MDPC codes and applications to BIKE KEM. IACR Transactions on Cryptographic Hardware and Embedded Systems, v. 2022, n. 4, p. 110-134, 2022Tradução . . Disponível em: https://doi.org/10.46586/tches.v2022.i4.110-134. Acesso em: 21 out. 2024.
APA
Paiva, T. B., & Terada, R. (2022). Faster constant-time decoder for MDPC codes and applications to BIKE KEM. IACR Transactions on Cryptographic Hardware and Embedded Systems, 2022( 4), 110-134. doi:10.46586/tches.v2022.i4.110-134
NLM
Paiva TB, Terada R. Faster constant-time decoder for MDPC codes and applications to BIKE KEM [Internet]. IACR Transactions on Cryptographic Hardware and Embedded Systems. 2022 ; 2022( 4): 110-134.[citado 2024 out. 21 ] Available from: https://doi.org/10.46586/tches.v2022.i4.110-134
Vancouver
Paiva TB, Terada R. Faster constant-time decoder for MDPC codes and applications to BIKE KEM [Internet]. IACR Transactions on Cryptographic Hardware and Embedded Systems. 2022 ; 2022( 4): 110-134.[citado 2024 out. 21 ] Available from: https://doi.org/10.46586/tches.v2022.i4.110-134
Parte de monografia/livro
Lyapunov exponent: a qualitative ranking of block cipher modes of operation (2013)
Machicao, Jeaneth; Marco, Anderson; Bruno, Odemir Martinez
Fonte: Proceedings of the European Conference on Complex Systems 2012. Unidade: IFSC
Assuntos: CRIPTOLOGIA, SISTEMAS DINÂMICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MACHICAO, Jeaneth e MARCO, Anderson e BRUNO, Odemir Martinez. Lyapunov exponent: a qualitative ranking of block cipher modes of operation. Proceedings of the European Conference on Complex Systems 2012. Tradução . Heidelberg: Springer, 2013. . Disponível em: https://doi.org/10.1007/978-3-319-00395-5_117. Acesso em: 21 out. 2024.
APA
Machicao, J., Marco, A., & Bruno, O. M. (2013). Lyapunov exponent: a qualitative ranking of block cipher modes of operation. In Proceedings of the European Conference on Complex Systems 2012. Heidelberg: Springer. doi:10.1007/978-3-319-00395-5_117
NLM
Machicao J, Marco A, Bruno OM. Lyapunov exponent: a qualitative ranking of block cipher modes of operation [Internet]. In: Proceedings of the European Conference on Complex Systems 2012. Heidelberg: Springer; 2013. [citado 2024 out. 21 ] Available from: https://doi.org/10.1007/978-3-319-00395-5_117
Vancouver
Machicao J, Marco A, Bruno OM. Lyapunov exponent: a qualitative ranking of block cipher modes of operation [Internet]. In: Proceedings of the European Conference on Complex Systems 2012. Heidelberg: Springer; 2013. [citado 2024 out. 21 ] Available from: https://doi.org/10.1007/978-3-319-00395-5_117
Trabalho de evento
A new approach to χ2 cryptanalysis of block ciphers (2009)
Nakahara Jr., Jorge ; Sekar, Gautham; Freitas, Daniel Santana de; Chiann, Chang ; Souza, Ramon Hugo de ; Preneel, Bart
Fonte: Proceedings. Nome do evento: International Conference on Information Security - ISC. Unidade: IME
Assunto: CRIPTOLOGIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NAKAHARA JR., Jorge et al. A new approach to χ2 cryptanalysis of block ciphers. 2009, Anais.. Berlin: Springer, 2009. Disponível em: https://doi.org/10.1007/978-3-642-04474-8_1. Acesso em: 21 out. 2024.
APA
Nakahara Jr., J., Sekar, G., Freitas, D. S. de, Chiann, C., Souza, R. H. de, & Preneel, B. (2009). A new approach to χ2 cryptanalysis of block ciphers. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-04474-8_1
NLM
Nakahara Jr. J, Sekar G, Freitas DS de, Chiann C, Souza RH de, Preneel B. A new approach to χ2 cryptanalysis of block ciphers [Internet]. Proceedings. 2009 ;[citado 2024 out. 21 ] Available from: https://doi.org/10.1007/978-3-642-04474-8_1
Vancouver
Nakahara Jr. J, Sekar G, Freitas DS de, Chiann C, Souza RH de, Preneel B. A new approach to χ2 cryptanalysis of block ciphers [Internet]. Proceedings. 2009 ;[citado 2024 out. 21 ] Available from: https://doi.org/10.1007/978-3-642-04474-8_1
Parte de monografia/livro
Efficient and provably-secure identity-based signatures and signcryption from bilinear maps (2005)
Barreto, Paulo Sérgio Licciardi Messeder ; Libert, Benoit; McCullagh, Noel; Quisquater, Jean-Jacques
Fonte: Advances in Cryptology ASIACRYPT 2005. Nome do evento: International Conference on the Theory and Application of Cryptology and Information Security. Unidade: EP
Assunto: CRIPTOLOGIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BARRETO, Paulo Sérgio Licciardi Messeder et al. Efficient and provably-secure identity-based signatures and signcryption from bilinear maps. Advances in Cryptology ASIACRYPT 2005. Tradução . Berlin: Springer Verlag, 2005. . . Acesso em: 21 out. 2024.
APA
Barreto, P. S. L. M., Libert, B., McCullagh, N., & Quisquater, J. -J. (2005). Efficient and provably-secure identity-based signatures and signcryption from bilinear maps. In Advances in Cryptology ASIACRYPT 2005. Berlin: Springer Verlag.
NLM
Barreto PSLM, Libert B, McCullagh N, Quisquater J-J. Efficient and provably-secure identity-based signatures and signcryption from bilinear maps. In: Advances in Cryptology ASIACRYPT 2005. Berlin: Springer Verlag; 2005. [citado 2024 out. 21 ]
Vancouver
Barreto PSLM, Libert B, McCullagh N, Quisquater J-J. Efficient and provably-secure identity-based signatures and signcryption from bilinear maps. In: Advances in Cryptology ASIACRYPT 2005. Berlin: Springer Verlag; 2005. [citado 2024 out. 21 ]
Parte de monografia/livro
Efficient algorithms for pairing-based cryptosystems (2002)
Barreto, Paulo Sérgio Licciardi Messeder ; Hae, Yong Kim ; Lynn, Ben; Scott, Michael
Fonte: Advances in Cryptology - CRYPTO 2002: proceedings. Nome do evento: International Cryptology Conference Santa Barbara, 2002 - Proceedings. Unidade: EP
Assunto: CRIPTOLOGIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BARRETO, Paulo Sérgio Licciardi Messeder et al. Efficient algorithms for pairing-based cryptosystems. Advances in Cryptology - CRYPTO 2002: proceedings. Tradução . Berlin: Springer, 2002. . . Acesso em: 21 out. 2024.
APA
Barreto, P. S. L. M., Hae, Y. K., Lynn, B., & Scott, M. (2002). Efficient algorithms for pairing-based cryptosystems. In Advances in Cryptology - CRYPTO 2002: proceedings. Berlin: Springer.
NLM
Barreto PSLM, Hae YK, Lynn B, Scott M. Efficient algorithms for pairing-based cryptosystems. In: Advances in Cryptology - CRYPTO 2002: proceedings. Berlin: Springer; 2002. [citado 2024 out. 21 ]
Vancouver
Barreto PSLM, Hae YK, Lynn B, Scott M. Efficient algorithms for pairing-based cryptosystems. In: Advances in Cryptology - CRYPTO 2002: proceedings. Berlin: Springer; 2002. [citado 2024 out. 21 ]
Trabalho de evento
Quadratic relations for s-boxes: their minimum representations and bounds (2001)
Terada, Routo; Pinheiro, Paulo Geraldo
Fonte: Proceedings. Nome do evento: International Conference on Information Security - ISC. Unidade: IME
Assunto: CRIPTOLOGIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TERADA, Routo e PINHEIRO, Paulo Geraldo. Quadratic relations for s-boxes: their minimum representations and bounds. 2001, Anais.. Berlin: Springer, 2001. Disponível em: https://doi.org/10.1007/3-540-45439-X_20. Acesso em: 21 out. 2024.
APA
Terada, R., & Pinheiro, P. G. (2001). Quadratic relations for s-boxes: their minimum representations and bounds. In Proceedings. Berlin: Springer. doi:10.1007/3-540-45439-X_20
NLM
Terada R, Pinheiro PG. Quadratic relations for s-boxes: their minimum representations and bounds [Internet]. Proceedings. 2001 ;[citado 2024 out. 21 ] Available from: https://doi.org/10.1007/3-540-45439-X_20
Vancouver
Terada R, Pinheiro PG. Quadratic relations for s-boxes: their minimum representations and bounds [Internet]. Proceedings. 2001 ;[citado 2024 out. 21 ] Available from: https://doi.org/10.1007/3-540-45439-X_20
Trabalho de evento
An augmented family of cryptographic parity circuits (1998)
Koyama, Kenji; Terada, Routo
Fonte: Proceedings. Nome do evento: International Workshop on Information Security - ISW. Unidade: IME
Assunto: CRIPTOLOGIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOYAMA, Kenji e TERADA, Routo. An augmented family of cryptographic parity circuits. 1998, Anais.. Berlin: Springer, 1998. Disponível em: https://doi.org/10.1007/BFb0030421. Acesso em: 21 out. 2024.
APA
Koyama, K., & Terada, R. (1998). An augmented family of cryptographic parity circuits. In Proceedings. Berlin: Springer. doi:10.1007/BFb0030421
NLM
Koyama K, Terada R. An augmented family of cryptographic parity circuits [Internet]. Proceedings. 1998 ;[citado 2024 out. 21 ] Available from: https://doi.org/10.1007/BFb0030421
Vancouver
Koyama K, Terada R. An augmented family of cryptographic parity circuits [Internet]. Proceedings. 1998 ;[citado 2024 out. 21 ] Available from: https://doi.org/10.1007/BFb0030421
Trabalho de evento
Nonlinear parity circuits and their cryptographic applications (1991)
Koyama, Kenji; Terada, Routo
Fonte: Proceedings. Nome do evento: Conference on the Theory and Application of Cryptography - CRYPTO. Unidade: IME
Assunto: CRIPTOLOGIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOYAMA, Kenji e TERADA, Routo. Nonlinear parity circuits and their cryptographic applications. 1991, Anais.. Berlin: Springer, 1991. Disponível em: https://doi.org/10.1007/3-540-38424-3_41. Acesso em: 21 out. 2024.
APA
Koyama, K., & Terada, R. (1991). Nonlinear parity circuits and their cryptographic applications. In Proceedings. Berlin: Springer. doi:10.1007/3-540-38424-3_41
NLM
Koyama K, Terada R. Nonlinear parity circuits and their cryptographic applications [Internet]. Proceedings. 1991 ;[citado 2024 out. 21 ] Available from: https://doi.org/10.1007/3-540-38424-3_41
Vancouver
Koyama K, Terada R. Nonlinear parity circuits and their cryptographic applications [Internet]. Proceedings. 1991 ;[citado 2024 out. 21 ] Available from: https://doi.org/10.1007/3-540-38424-3_41

Unidades USP

ReP

Filtros

Departamento

Autores

Autores USP

Ano de publicação

Nome do evento

Agência de fomento

Afiliação dos autores externos não normalizada