Routo Terada - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 27 from 27

2024

Recovery of the secret on Binary Ring-LWE problem using random known bits - Extended VersionReynaldo Cáceres Villena, Routo Terada. jisa, 15(1):39-45, 2024. [doi]

2023

Applying Hoeffding Tree Algorithms for Effective Stream Learning in IoT DDoS DetectionJoão Gabriel Andrade de Araújo Josephik, Yaissa Siqueira, Kétly Gonçalves Machado, Routo Terada, Aldri Luiz dos Santos, Michele Nogueira, Daniel Macêdo Batista. latincom 2023: 1-6 [doi]

2022

2021

BGP Anomalies Classification using Features based on AS Relationship GraphsThales Bandiera Paiva, Yaissa Siqueira, Daniel Macêdo Batista, Roberto Hirata, Routo Terada. latincom 2021: 1-6 [doi]

Cryptanalysis of the Binary Permuted Kernel ProblemThales Bandiera Paiva, Routo Terada. acns 2021: 396-423 [doi]

Cryptanalysis of the Binary Permuted Kernel ProblemThales Bandiera Paiva, Routo Terada. iacr, 2021:398, 2021. [doi]

2019

A Timing Attack on the HQC Encryption SchemeThales Bandiera Paiva, Routo Terada. sacrypt 2020: 551-573 [doi]

Robust Covert Channels Based on DRAM Power ConsumptionThales Bandiera Paiva, Javier Navaridas, Routo Terada. isw 2019: 319-338 [doi]

2018

Improving the Efficiency of a Reaction Attack on the QC-MDPC McElieceThales Bandiera Paiva, Routo Terada. ieicet, 101-A(10):1676-1686, 2018. [doi]

2016

Certificateless Key Agreement Protocols under Strong ModelsDenise H. Goya, Dionathan Nakamura, Routo Terada. ieicet, 99-A(10):1822-1832, 2016. [doi]

MQ Problem and QuartzRouto Terada, Ewerton R. Andrade. ieicet, 99-A(12):2527-2538, 2016. [doi]

2015

MQ ProblemFábio S. Monteiro, Denise H. Goya, Routo Terada. ieicet, 98-A(6):1255-1265, 2015. [doi]

2014

RSA and Elliptic Curve Least Significant Bit SecurityDionathan Nakamura, Routo Terada. latincrypt 2015: 146-161 [doi]

2013

N with Random BitsRouto Terada, Reynaldo Cáceres Villena. isw 2015: 185-196 [doi]

2009

2 CryptanalysisRouto Terada, Eduardo T. Ueda. auisc 2009: 47-52 [doi]

2004

An IBE Scheme to Exchange Authenticated Secret KeysWaldyr D. Benits Jr., Routo Terada. iacr, 2004:71, 2004. [doi]

2001

Multi-Resolution Classification Trees in OCR DesignMarcel Brun, Junior Barrera, Nina S. T. Hirata, Nestor W. Trepode, Daniel O. Dantas, Routo Terada. sibgrapi 2001: 59-66 [doi]

Quadratic Relations for S-Boxes: Their Minimum Representations and BoundsRouto Terada, Paulo G. Pinheiro. iiswc 2001: 294-309 [doi]

2000

Boosting OCR Classifier by Optimal Edge Noise FilteringJunior Barrera, Marcel Brun, Routo Terada, Edward R. Dougherty. ismm 2000: 371-380 [doi]

Automatic Programming of Morphological Machines by PAC LearningJunior Barrera, Routo Terada, Roberto Hirata Jr., Nina S. T. Hirata. FUIN, 41(1-2):229-258, 2000.

Text Segmentation by Automatically Designed Morphological OperatorsNina S. T. Hirata, Junior Barrera, Routo Terada. sibgrapi 2000: 284-291 [doi]

1997

An Augmented Family of Cryptographic Parity CircuitsKenji Koyama, Routo Terada. iiswc 1998: 198-208

1996

Automatic Programming of MMach's for OCRJunior Barrera, Routo Terada, Flávio Soares Corrêa da Silva, Nina Sumiko Tomita. ismm 1996: 385-392 [doi]

1990

Nonlinear Parity Circuits and their Cryptographic ApplicationsKenji Koyama, Routo Terada. crypto 1991: 582-600 [doi]

1982

A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability OneJ. H. Halton, Routo Terada. SICOMP, 11(1):28-46, 1982.

Sign in or sign up to see more results.

runs on WebDSL