![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Daisaburo Yoshioka
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c6]Daisaburo Yoshioka:
Periodic Properties of Commutative Polynomials Defined by Fourth Order Recurrence Relations with Two Variables Over Z2k. ISIT 2023: 1425-1429 - 2020
- [j8]Daisaburo Yoshioka
:
Security of Public-Key Cryptosystems Based on Chebyshev Polynomials Over $\mathbb Z/p^{k}\mathbb Z$. IEEE Trans. Circuits Syst. II Express Briefs 67-II(10): 2204-2208 (2020)
2010 – 2019
- 2019
- [c5]Daisaburo Yoshioka:
A Circuit Design of Discretized Chaotic Maps with Two Iterations for Speeding up S-box Generation. APCCAS 2019: 241-244 - 2018
- [j7]Daisaburo Yoshioka
:
Properties of Chebyshev Polynomials Modulo pk. IEEE Trans. Circuits Syst. II Express Briefs 65-II(3): 386-390 (2018) - [c4]Daisaburo Yoshioka:
Security of Public-Key Cryptosystems Based on Chebyshev Polynomials over the Residue Ring Z/pkZ. GLOBECOM 2018: 1-4 - 2016
- [j6]Daisaburo Yoshioka, Kento Kawano:
Periodic Properties of Chebyshev Polynomial Sequences Over the Residue Ring ℤ/2kℤ. IEEE Trans. Circuits Syst. II Express Briefs 63-II(8): 778-782 (2016) - 2015
- [c3]Daisaburo Yoshioka, Yuta Dainobu:
Some properties of sequences generated by Chebyshev polynomials modulo 2k. ISCAS 2015: 846-849 - 2014
- [j5]Daisaburo Yoshioka, Akio Tsuneda:
The Design of Low Complexity S-Boxes Based on a Discretized Piecewise Linear Chaotic Map. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1396-1404 (2014) - 2013
- [c2]Daisaburo Yoshioka:
Hardware implementable S-box based on a discretized piecewise linear chaotic map. IWCMC 2013: 1120-1125 - 2012
- [c1]Daisaburo Yoshioka:
Design of a low complexity S-box based on a piecewise linear chaotic map. ICECS 2012: 853-856 - 2011
- [j4]Daisaburo Yoshioka, Akio Tsuneda:
Design of Maximum Length Pseudochaotic Sequences Derived from Discretized 1-D Chaotic Maps and Their Autocorrelation Properties. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(6): 1408-1416 (2011)
2000 – 2009
- 2007
- [j3]Akio Tsuneda, Kunihiko Kudo, Daisaburo Yoshioka, Takahiro Inoue:
Maximal-Period Sequences Generated by Feedback-Limited Nonlinear Shift Registers. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(10): 2079-2084 (2007) - 2005
- [j2]Daisaburo Yoshioka, Akio Tsuneda, Takahiro Inoue:
On Transformation between Discretized Bernoulli and Tent Maps. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(10): 2678-2683 (2005) - 2003
- [j1]Daisaburo Yoshioka, Akio Tsuneda, Takahiro Inoue:
Maximal-Period Sequences with Negative Auto-Correlations and Their Application to Asynchronous DS-CDMA Systems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(6): 1405-1413 (2003)
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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 2024-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint