Satoshi Uehara

Orcid: 0000-0002-1467-5047

According to our database1, Satoshi Uehara authored at least 70 papers between 1996 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Study on a New Pseudorandom Number Generator with Deterministic Maze Construction.
Proceedings of the International Conference on Consumer Electronics - Taiwan, 2024

Relation between Recognition Accuracy and Object's Occupancy in CAPTCHA Image Using Weave Filters.
Proceedings of the International Conference on Consumer Electronics - Taiwan, 2024

2023
How to Construct Pseudorandom Bit Sequences from Mazes by a Method Digging Out Walls.
Proceedings of the International Conference on Consumer Electronics - Taiwan, 2023

A Study on Robustness Evaluation of Weave Filters against Reverse Image Search Attacks on CAPTCHA.
Proceedings of the International Conference on Consumer Electronics - Taiwan, 2023

Some Properties of Well-Balanced Sequences Obtained from Two Logistic Maps over Integers.
Proceedings of the International Conference on Consumer Electronics - Taiwan, 2023

2022
A Study on a DDH-Based Keyed Homomorphic Encryption Suitable to Machine Learning in the Cloud.
Proceedings of the IEEE International Conference on Consumer Electronics - Taiwan, 2022

A Study on Parameters of Piecewise Logistic Map over Large Integers and Processing Time.
Proceedings of the IEEE International Conference on Consumer Electronics - Taiwan, 2022

2021
A Study on Digital Watermarks for Audio Signals Using Phase of Frequency Signals in Addition to the Other Methods.
Proceedings of the IEEE International Conference on Consumer Electronics-Taiwan, 2021

A Study on Control Parameter and Output Sequence of the Logistic Map over Integers for Pseudorandom Number Generation.
Proceedings of the IEEE International Conference on Consumer Electronics-Taiwan, 2021

A Study on Relationship Between Period and Number of Divisions in Piecewise Logistic Map over Integers.
Proceedings of the IEEE International Conference on Consumer Electronics-Taiwan, 2021

2020
Equivalent Keys of a Nonlinear Filter Generator Using a Power Residue Symbol.
Proceedings of the Advances in Information and Computer Security, 2020

A Study on Binary Sequences Located in Hadamard Matrices of Order 2<sup>n</sup>.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

A Parallel Blum-Micali Generator Based on the Gauss Periods.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

A Study on Randomness of Sequences Obtained from Piecewise Logistic Map over Integers.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

2019
Algebraic Group Structure of the Random Number Generator: Theoretical Analysis of NTU Sequence(s).
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Properties of Knuth's Quadratic Congruential Sequences with Modulus m = 2<sup>W</sup> p.
Proceedings of the Ninth International Workshop on Signal Design and its Applications in Communications, 2019

Relations Between Evaluations of NIST Tests and Lyapunov Exponents of Sequences Generated by the Piecewise Logistic Map over Integers.
Proceedings of the Ninth International Workshop on Signal Design and its Applications in Communications, 2019

Mutual Relationship between the Neural Network Model and Linear Complexity for Pseudorandom Binary Number Sequence.
Proceedings of the Seventh International Symposium on Computing and Networking Workshops, 2019

2018
Visualizing motions of magnetic fluid spikes for a novel particle-collecting device.
J. Vis., 2018

Linear Complexity of Geometric Sequences Defined by Cyclotomic Classes and Balanced Binary Sequences Constructed by the Geometric Sequences.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Distribution of Digit Patterns in Multi-Value Sequence over the Odd Characteristic Field.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

A Study on Computational Methods of the Logistic Map over Integers for a Pseudorandom Number Generator.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Bit Distribution of Binary Sequence Generated by Trace Function and Legendre Symbol Over Sub Extension Field.
Proceedings of the 6th International Conference on Information Technology: IoT and Smart City, 2018

2017
Interleaved Sequences of Geometric Sequences Binarized with Legendre Symbol of Two Types.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Multi-Valued Sequences Generated by Power Residue Symbols over Odd Characteristic Fields.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Linear complexity of generalized NTU sequences.
Proceedings of the Eighth International Workshop on Signal Design and Its Applications in Communications, 2017

Some properties of Z4 sequences obtained by using the gray code mapping from two binary m-sequences.
Proceedings of the Eighth International Workshop on Signal Design and Its Applications in Communications, 2017

Linear complexity of pseudo random binary sequence generated by trace function and Legendre symbol over proper sub extension field.
Proceedings of the Eighth International Workshop on Signal Design and Its Applications in Communications, 2017

Solving 114-Bit ECDLP for a Barreto-Naehrig Curve.
Proceedings of the Information Security and Cryptology - ICISC 2017 - 20th International Conference, Seoul, South Korea, November 29, 2017

An Efficient Implementation of Trace Calculation over Finite Field for a Pseudorandom Sequence.
Proceedings of the Fifth International Symposium on Computing and Networking, 2017

2016
A Multi-Value Sequence Generated by Power Residue Symbol and Trace Function over Odd Characteristic Field.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

Occurrence rate per bit for any control parameter on the logistic map over integers.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

A new approach for generating well balanced Pseudo-random signed binary sequence over odd characteristic field.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

A design guide of renewal of a parameter of the logistic map over integers on pseudorandom number generator.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Auto and Cross Correlation of Well Balanced Sequence over Odd Characteristic Field.
Proceedings of the Fourth International Symposium on Computing and Networking, 2016

2015
Role of time scales for the non-Gaussianity of the Brownian motion combined with intermittent adsorption.
J. Comput. Sci., 2015

A Consideration on Crosscorrelation of a Kind of Trace Sequences over Finite Field.
Proceedings of the Third International Symposium on Computing and Networking, 2015

2014
A Geometric Sequence Binarized with Legendre Symbol over Odd Characteristic Field and Its Properties.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

The So-called Person Restriction of Internal State Predicates in Japanese in Contrast with Thai.
Proceedings of the 28th Pacific Asia Conference on Language, Information and Computation, 2014

Some properties of the maximum period on the logistic map over Z2n.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

An efficient generation of geometric sequences defined with trace and legendre symbol.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Relations between evaluations of NIST tests and Lyapunov exponents of sequences generated by the logistic map over integers.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

A study of an automorphism on the logistic maps over prime fields.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Initial values entering into an element zero with period one for logistic maps over integers.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Characteristics of Displacement Data Due to Time Scale for the Combination of Brownian Motion with Intermittent Adsorption.
Proceedings of the International Conference on Computational Science, 2014

2013
A binarization of geometric sequences with Legendre symbol and its autocorrelation.
Proceedings of the Sixth International Workshop on Signal Design and Its Applications in Communications, 2013

A study on the Lyapunov exponents of sequences generated by the logistic map over integers.
Proceedings of the Sixth International Workshop on Signal Design and Its Applications in Communications, 2013

A study on distance between two sequences by the logistic map over integers with slightly different parameters.
Proceedings of the Sixth International Workshop on Signal Design and Its Applications in Communications, 2013

2012
Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic Group.
IEEE Trans. Inf. Theory, 2012

Distribution of the loops on the logistic maps over integers for the control parameter.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

A study on precision of pseudorandom number generators using the logistic map.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

2011
Rounding Logistic Maps over Integers and the Properties of the Generated Sequences.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

Relations between periods and control parameters in the logistic map over integers.
Proceedings of the Fifth International Workshop on Signal Design and its Applications in Communications, 2011

Cross-correlation distribution of binary sequences generated from three m-sequences.
Proceedings of the Fifth International Workshop on Signal Design and its Applications in Communications, 2011

A Multiplicative Extension for Discrete Logarithms on Ordinary Pairing-Friendly Curves of Embedding Degree.
Proceedings of the Fifth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, 2011

Rho Method with Period k on Non - symmetric Ordinary Pairings of Embedding Degree k - Especially for Barreto - Naehrig Curves.
Proceedings of the Fifth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, 2011

2010
Some Properties of Logistic Maps over Integers.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

Syntactic and Semantic Discrepancies among the Verbs for 'kill' in English, Chinese and Thai.
Proceedings of the 24th Pacific Asia Conference on Language, Information and Computation, 2010

A study on differences in properties of the logistic maps over integers affected by rounding.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

Suitable representation of values on the logistic map with finite precision.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

2008
Zero Correlation Distribution of ZCZ Sequences Obtained from a Perfect Sequence and a Unitary Matrix.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

A method for constructing a self-dual normal basis in odd characteristic extension fields.
Finite Fields Their Appl., 2008

A Method for Constructing a Pseudo Self-Dual Normal Basis.
Cybern. Syst., 2008

2003
Linear Complexities of Periodic Sequences Obtained from Sequences over <i>Z</i><sub>4</sub> and <i>Z</i><sub>8</sub> by One-Symbol Substitution.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

2001
Characteristic Polynomials of Binary Kronecker Sequences.
Proceedings of the Sequences and their Applications, 2001

On the Profile of the k-Error Linear Complexity and the Zero Sum Property for Sequences over GF(p m) with Period p n.
Proceedings of the Sequences and their Applications, 2001

1999
An Algorithm for thek-Error Linear Complexity of Sequences over GF(p<sup>m</sup>) with Period p<sup>n</sup>, pa Prime.
Inf. Comput., 1999

1998
A New Algorithm for the k -Error Linear Complexity of Sequences over GF(p m) with Period p n.
Proceedings of the Sequences and their Applications, 1998

1996
Are Pronouns Always Zero in Zero Pronominal Languages? : The Case in Japanese.
Proceedings of the 11th Pacific Asia Conference on Language, Information and Computation, 1996

Computation of the k-Error Linear Complexity of Binary Sequences with Period 2<sup>n</sup>.
Proceedings of the Concurrency and Parallelism, 1996


  Loading...