Routo Terada

Orcid: 0000-0001-9242-2806

Affiliations:
  • University of Sao Paulo, Brazil


According to our database1, Routo Terada authored at least 26 papers between 1982 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Recovery of the secret on Binary Ring-LWE problem using random known bits - Extended Version.
J. Internet Serv. Appl., 2024

2023
Applying Hoeffding Tree Algorithms for Effective Stream Learning in IoT DDoS Detection.
Proceedings of the IEEE Latin-American Conference on Communications, 2023

2022
Faster Constant-Time Decoder for MDPC Codes and Applications to BIKE KEM.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2022

Vulnerability - Information Leakage of Reused Secret Key in NewHope.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022

A Stacked Ensemble Classifier for an Intrusion Detection System in the Edge of IoT and IIoT Networks.
Proceedings of the IEEE Latin-American Conference on Communications, 2022

2021
Cryptanalysis of the Binary Permuted Kernel Problem.
IACR Cryptol. ePrint Arch., 2021

BGP Anomalies Classification using Features based on AS Relationship Graphs.
Proceedings of the IEEE Latin-American Conference on Communications, 2021

2019
A Timing Attack on the HQC Encryption Scheme.
Proceedings of the Selected Areas in Cryptography - SAC 2019, 2019

Robust Covert Channels Based on DRAM Power Consumption.
Proceedings of the Information Security - 22nd International Conference, 2019

2018
Improving the Efficiency of a Reaction Attack on the QC-MDPC McEliece.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

2016
Comparison of Two Signature Schemes Based on the <i>MQ</i> Problem and Quartz.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

Certificateless Key Agreement Protocols under Strong Models.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

2015
Improved Identification Protocol Based on the <i>MQ</i> Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

2014
RSA and Elliptic Curve Least Significant Bit Security.
Proceedings of the Progress in Cryptology - LATINCRYPT 2014, 2014

2013
Factoring a Multiprime Modulus <i>N</i> with Random Bits.
Proceedings of the Information Security, 16th International Conference, 2013

2009
A New Version of the RC6 Algorithm, Stronger against χ<sup>2</sup> Cryptanalysis.
Proceedings of the Seventh Australasian Information Security Conference, 2009

2004
An IBE Scheme to Exchange Authenticated Secret Keys.
IACR Cryptol. ePrint Arch., 2004

2001
Multi-Resolution Classification Trees in OCR Design.
Proceedings of the 14th Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2001), 2001

Quadratic Relations for S-Boxes: Their Minimum Representations and Bounds.
Proceedings of the Information Security, 4th International Conference, 2001

2000
Automatic Programming of Morphological Machines by PAC Learning.
Fundam. Informaticae, 2000

Text Segmentation by Automatically Designed Morphological Operators.
Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2000), 2000

Boosting OCR Classifier by Optimal Edge Noise Filtering.
Proceedings of the 5th International Symposium on Mathematical Morphology and its Applications to Image and Signal Processing, 2000

1997
An Augmented Family of Cryptographic Parity Circuits.
Proceedings of the Information Security, First International Workshop, 1997

1996
Automatic Programming of MMach's for OCR.
Proceedings of the 3th International Symposium on Mathematical Morphology and its Applications to Image and Signal Processing, 1996

1990
Nonlinear Parity Circuits and their Cryptographic Applications.
Proceedings of the Advances in Cryptology, 1990

1982
A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One.
SIAM J. Comput., 1982


  Loading...