default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRouto Terada
Person information
- affiliation: University of Sao Paulo, Brazil
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Reynaldo Cáceres Villena
, Routo Terada:
Recovery of the secret on Binary Ring-LWE problem using random known bits - Extended Version. J. Internet Serv. Appl. 15(1): 39-45 (2024)- 2023
- [c16]Joã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:
Applying Hoeffding Tree Algorithms for Effective Stream Learning in IoT DDoS Detection. LATINCOM 2023: 1-6 - 2022
- [j8]Routo Terada, Reynaldo Cáceres Villena:
Vulnerability - Information Leakage of Reused Secret Key in NewHope. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(6): 952-964 (2022) - [j7]Thales Bandiera Paiva, Routo Terada:
Faster Constant-Time Decoder for MDPC Codes and Applications to BIKE KEM. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(4): 110-134 (2022) - [c15]Giovanni Aparecido Da Silva Oliveira, Priscila Serra Silva Lima, Fabio Kon, Routo Terada, Daniel Macêdo Batista, Roberto Hirata, Mosab Hamdan:
A Stacked Ensemble Classifier for an Intrusion Detection System in the Edge of IoT and IIoT Networks. LATINCOM 2022: 1-6 - 2021
- [c14]Thales Bandiera Paiva, Routo Terada:
Cryptanalysis of the Binary Permuted Kernel Problem. ACNS (2) 2021: 396-423 - [c13]Thales Bandiera Paiva, Yaissa Siqueira, Daniel Macêdo Batista, Roberto Hirata, Routo Terada:
BGP Anomalies Classification using Features based on AS Relationship Graphs. LATINCOM 2021: 1-6 - [i2]Thales Bandiera Paiva, Routo Terada:
Cryptanalysis of the Binary Permuted Kernel Problem. IACR Cryptol. ePrint Arch. 2021: 398 (2021)
2010 – 2019
- 2019
- [c12]Thales Bandiera Paiva, Javier Navaridas, Routo Terada:
Robust Covert Channels Based on DRAM Power Consumption. ISC 2019: 319-338 - [c11]Thales Bandiera Paiva, Routo Terada:
A Timing Attack on the HQC Encryption Scheme. SAC 2019: 551-573 - 2018
- [j6]Thales Bandiera Paiva, Routo Terada:
Improving the Efficiency of a Reaction Attack on the QC-MDPC McEliece. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(10): 1676-1686 (2018) - 2016
- [j5]Denise H. Goya, Dionathan Nakamura, Routo Terada:
Certificateless Key Agreement Protocols under Strong Models. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(10): 1822-1832 (2016) - [j4]Routo Terada, Ewerton R. Andrade:
Comparison of Two Signature Schemes Based on the MQ Problem and Quartz. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(12): 2527-2538 (2016) - 2015
- [j3]Fábio S. Monteiro, Denise H. Goya, Routo Terada:
Improved Identification Protocol Based on the MQ Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1255-1265 (2015) - 2014
- [c10]Dionathan Nakamura, Routo Terada:
RSA and Elliptic Curve Least Significant Bit Security. LATINCRYPT 2014: 146-161 - 2013
- [c9]Routo Terada, Reynaldo Cáceres Villena:
Factoring a Multiprime Modulus N with Random Bits. ISC 2013: 185-196
2000 – 2009
- 2009
- [c8]Routo Terada, Eduardo T. Ueda:
A New Version of the RC6 Algorithm, Stronger against χ2 Cryptanalysis. AISC 2009: 47-52 - 2004
- [i1]Waldyr D. Benits Jr., Routo Terada:
An IBE Scheme to Exchange Authenticated Secret Keys. IACR Cryptol. ePrint Arch. 2004: 71 (2004) - 2001
- [c7]Routo Terada, Paulo G. Pinheiro:
Quadratic Relations for S-Boxes: Their Minimum Representations and Bounds. ISC 2001: 294-309 - [c6]Marcel Brun, Junior Barrera, Nina S. T. Hirata, Nestor Walter Trepode, Daniel Oliveira Dantas, Routo Terada:
Multi-Resolution Classification Trees in OCR Design. SIBGRAPI 2001: 59-66 - 2000
- [j2]Junior Barrera, Routo Terada, Roberto Hirata Jr., Nina S. T. Hirata:
Automatic Programming of Morphological Machines by PAC Learning. Fundam. Informaticae 41(1-2): 229-258 (2000) - [c5]Junior Barrera, Marcel Brun, Routo Terada, Edward R. Dougherty:
Boosting OCR Classifier by Optimal Edge Noise Filtering. ISMM 2000: 371-380 - [c4]Nina S. T. Hirata, Junior Barrera, Routo Terada:
Text Segmentation by Automatically Designed Morphological Operators. SIBGRAPI 2000: 284-291
1990 – 1999
- 1997
- [c3]Kenji Koyama, Routo Terada:
An Augmented Family of Cryptographic Parity Circuits. ISW 1997: 198-208 - 1996
- [c2]Junior Barrera, Routo Terada, Flávio Soares Corrêa da Silva, Nina Sumiko Tomita:
Automatic Programming of MMach's for OCR. ISMM 1996: 385-392 - 1990
- [c1]Kenji Koyama, Routo Terada:
Nonlinear Parity Circuits and their Cryptographic Applications. CRYPTO 1990: 582-600
1980 – 1989
- 1982
- [j1]J. H. Halton, Routo Terada:
A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One. SIAM J. Comput. 11(1): 28-46 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
