![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Jun Yajima
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c14]Hiroshi Tanaka
, Masaru Ide
, Jun Yajima
, Sachiko Onodera
, Kazuki Munakata
, Nobukazu Yoshioka
:
Taxonomy of Generative AI Applications for Risk Assessment. CAIN 2024: 288-289 - 2023
- [j6]Jun Yajima
, Maki Inui, Takanori Oikawa, Fumiyoshi Kasahara, Kentaro Tsuji, Ikuya Morikawa, Nobukazu Yoshioka:
ASRA-Q: AI Security Risk Assessment by Selective Questions. J. Inf. Process. 31: 654-666 (2023) - 2022
- [c13]Jun Yajima
, Maki Inui, Takanori Oikawa, Fumiyoshi Kasahara, Ikuya Morikawa, Nobukazu Yoshioka:
A new approach for machine learning security risk assessment: work in progress. CAIN 2022: 52-53 - 2021
- [i4]Masataka Tasumi, Kazuki Iwahana, Naoto Yanai, Katsunari Shishido, Toshiya Shimizu, Yuji Higuchi, Ikuya Morikawa, Jun Yajima:
First to Possess His Statistics: Data-Free Model Extraction Attack on Tabular Data. CoRR abs/2109.14857 (2021) - 2020
- [j5]Jun Yajima
, Yasuhiko Abe, Takayuki Hasebe, Takao Okubo:
Anomaly Detection Method "Cumulative Sum Detection" for In-Vehicle Networks. J. Inf. Process. 28: 65-74 (2020)
2010 – 2019
- 2019
- [c12]Jun Yajima
, Takayuki Hasebe, Takao Okubo:
Data Relation Analysis Focusing on Plural Data Transition for Detecting Attacks on Vehicular Network. NBiS 2019: 270-280 - 2012
- [c11]Masaya Yasuda, Jun Yajima
, Takeshi Shimoyama, Jun Kogure:
Analysis of Lattice Reduction Attack against the Somewhat Homomorphic Encryption Based on Ideal Lattices. EuroPKI 2012: 1-16 - [c10]Tetsuya Izu, Masahiko Takenaka, Jun Yajima
, Takashi Yoshioka:
Integrity Assurance for Real-Time Video Recording. IMIS 2012: 651-655 - 2011
- [j4]Dai Yamamoto, Kouichi Itoh, Jun Yajima
:
Compact Architecture for ASIC and FPGA Implementation of the KASUMI Block Cipher. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(12): 2628-2638 (2011) - 2010
- [j3]Dai Yamamoto, Jun Yajima
, Kouichi Itoh:
Compact Architecture for ASIC Implementation of the MISTY1 Block Cipher. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(1): 3-12 (2010) - [c9]Jun Yajima
, Takeshi Shimoyama:
Matrix Representation of Conditions for the Collision Attack of SHA-1 and Its Application to the Message Modification. IWSEC 2010: 267-284 - [c8]Dai Yamamoto, Kouichi Itoh, Jun Yajima
:
A Very Compact Hardware Implementation of the KASUMI Block Cipher. WISTP 2010: 293-307
2000 – 2009
- 2009
- [j2]Jun Yajima
, Terutoshi Iwasaki, Yusuke Naito, Yu Sasaki, Takeshi Shimoyama, Thomas Peyrin, Noboru Kunihiro
, Kazuo Ohta:
A Strict Evaluation on the Number of Conditions for SHA-1 Collision Search. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(1): 87-95 (2009) - [j1]Kouichi Itoh, Dai Yamamoto, Jun Yajima
, Wakaha Ogata:
Collision-Based Power Attack for RSA with Small Public Exponent. IEICE Trans. Inf. Syst. 92-D(5): 897-908 (2009) - 2008
- [c7]Jun Yajima
, Terutoshi Iwasaki, Yusuke Naito, Yu Sasaki, Takeshi Shimoyama, Noboru Kunihiro
, Kazuo Ohta:
A strict evaluation method on the number of conditions for the SHA-1 collision search. AsiaCCS 2008: 10-20 - [c6]Dai Yamamoto, Jun Yajima
, Kouichi Itoh:
A Very Compact Hardware Implementation of the MISTY1 Block Cipher. CHES 2008: 315-330 - 2007
- [c5]Jun Yajima
, Yu Sasaki, Yusuke Naito, Terutoshi Iwasaki, Takeshi Shimoyama, Noboru Kunihiro, Kazuo Ohta:
A New Strategy for Finding a Differential Path of SHA-1. ACISP 2007: 45-58 - 2006
- [c4]Yusuke Naito, Yu Sasaki, Takeshi Shimoyama, Jun Yajima
, Noboru Kunihiro
, Kazuo Ohta:
Improved Collision Search for SHA-0. ASIACRYPT 2006: 21-36 - [c3]Yu Sasaki, Yusuke Naito, Jun Yajima
, Takeshi Shimoyama, Noboru Kunihiro, Kazuo Ohta:
How to Construct Sufficient Conditions for Hash Functions. VIETCRYPT 2006: 243-259 - [i3]Yusuke Naito, Yu Sasaki, Takeshi Shimoyama, Jun Yajima, Noboru Kunihiro, Kazuo Ohta:
Message Modification for Step 21-23 on SHA-0. IACR Cryptol. ePrint Arch. 2006: 16 (2006) - [i2]Yu Sasaki, Yusuke Naito, Jun Yajima, Takeshi Shimoyama, Noboru Kunihiro, Kazuo Ohta:
How to Construct Sufficient Condition in Searching Collisions of MD5. IACR Cryptol. ePrint Arch. 2006: 74 (2006) - 2005
- [i1]Jun Yajima, Takeshi Shimoyama:
Wang's sufficient conditions of MD5 are not sufficient. IACR Cryptol. ePrint Arch. 2005: 263 (2005) - 2002
- [c2]Kouichi Itoh, Jun Yajima
, Masahiko Takenaka, Naoya Torii:
DPA Countermeasures by Improving the Window Method. CHES 2002: 303-317 - 2001
- [c1]Takeshi Shimoyama, Hitoshi Yanami, Kazuhiro Yokoyama, Masahiko Takenaka, Kouichi Itoh, Jun Yajima
, Naoya Torii, Hidema Tanaka:
The Block Cipher SC2000. FSE 2001: 312-327
Coauthor Index
![](https://dblp.dagstuhl.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-06-25 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint