![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 27 matches
- 2023
- Yi Deng, Moti Yung
:
Information Security and Cryptology - 18th International Conference, Inscrypt 2022, Beijing, China, December 11-13, 2022, Revised Selected Papers. Lecture Notes in Computer Science 13837, Springer 2023, ISBN 978-3-031-26552-5 [contents] - 2022
- Weiwei Cao, Wentao Zhang, Chunning Zhou:
New Automatic Search Tool for Searching for Impossible Differentials Using Undisturbed Bits. Inscrypt 2022: 43-63 - Cheng Che, Tian Tian:
An Experimentally Verified Attack on 820-Round Trivium. Inscrypt 2022: 357-369 - You Chen, Ning Ding, Dawu Gu, Yang Bian:
Practical Multi-party Private Set Intersection Cardinality and Intersection-Sum Under Arbitrary Collusion. Inscrypt 2022: 169-191 - Zhao Chen, Xianhui Lu, Dingding Jia, Bao Li:
IND-CCA Security of Kyber in the Quantum Random Oracle Model, Revisited. Inscrypt 2022: 148-166 - Tianyou Ding, Wentao Zhang, Chunning Zhou:
Clustering Effect of Iterative Differential and Linear Trails. Inscrypt 2022: 252-271 - Zhili Dong, Shixin Tian, Kunpeng Wang, Chang Lv:
Subfield Attacks on HSVP in Ideal Lattices. Inscrypt 2022: 447-462 - Jing Gao, Jun Xu, Lei Hu:
Inferring Sequences Produced by the Quadratic Generator. Inscrypt 2022: 483-494 - Wenshuo Guo, Fangwei Fu:
McEliece-Type Encryption Based on Gabidulin Codes with No Hidden Structure. Inscrypt 2022: 108-126 - Chenmeng Li, Baofeng Wu, Dongdai Lin:
Generalized Boomerang Connectivity Table and Improved Cryptanalysis of GIFT. Inscrypt 2022: 213-233 - Luying Li, Wei Yu:
A Note on Inverted Twisted Edwards Curve. Inscrypt 2022: 295-304 - Yunfan Li, Lingjing Yu, Qingyun Liu:
HinPage: Illegal and Harmful Webpage Identification Using Transductive Classification. Inscrypt 2022: 373-390 - Xiao Li, Wei Yu, Yuqing Zhu, Zhizhong Pan:
Efficiently Computable Complex Multiplication of Elliptic Curves. Inscrypt 2022: 305-317 - Bohan Li, Hailong Zhang, Dongdai Lin:
Higher-Order Masking Scheme for Trivium Hardware Implementation. Inscrypt 2022: 337-356 - Jing Li
, Sisi Zhang
, Xingbin Wang
, Rui Hou
:
Mimic Octopus Attack: Dynamic Camouflage Adversarial Examples Using Mimetic Feature for 3D Humans. Inscrypt 2022: 429-444 - Wenqiu Ma, Rui Zhang:
SR-MuSig2: A Scalable and Reconfigurable Multi-signature Scheme and Its Applications. Inscrypt 2022: 87-107 - Xin Miao, Chun Guo, Meiqin Wang, Weijia Wang:
How Fast Can SM4 be in Software? Inscrypt 2022: 3-22 - Qintao Shen, Hongyu Sun, Guozhu Meng, Kai Chen, Yuqing Zhang:
Detecting API Missing-Check Bugs Through Complete Cross Checking of Erroneous Returns. Inscrypt 2022: 391-407 - Qi Wang, Wenxin Li, Kang Yang, Yiru Zhao, Lei Zhao, Lina Wang:
Efficient DNN Backdoor Detection Guided by Static Weight Analysis. Inscrypt 2022: 408-428 - Yanan Wu, Nian Li, Xiangyong Zeng, Yuhua Cai:
Several Classes of Niho Type Boolean Functions with Few Walsh Transform Values. Inscrypt 2022: 318-333 - Qingyuan Yu
, Keting Jia
, Guangnan Zou, Guoyan Zhang:
Differential Cryptanalysis of Round-Reduced SPEEDY Family. Inscrypt 2022: 272-291 - Cong Zhang
, Shuaishuai Li, Dongdai Lin:
Amortizing Division and Exponentiation. Inscrypt 2022: 192-210 - Lulu Zhang, Meicheng Liu, Shuaishuai Li, Dongdai Lin:
Cryptanalysis of Ciminion. Inscrypt 2022: 234-251 - Min Zhang, Binbin Tu, Yu Chen:
You Can Sign but Not Decrypt: Hierarchical Integrated Encryption and Signature. Inscrypt 2022: 67-86 - Lei Zhang
, Ruichen Wu, Yuhan Zhang, Yafei Zheng, Wenling Wu:
LLLWBC: A New Low-Latency Light-Weight Block Cipher. Inscrypt 2022: 23-42 - Zishen Zhao, Guangwu Xu:
On the Measurement and Simulation of the BKZ Behavior for q-ary Lattices. Inscrypt 2022: 463-482 - Chengkai Zhu
, Zhenyu Huang
:
Optimizing the Depth of Quantum Implementations of Linear Layers. Inscrypt 2022: 129-147
loading more results
failed to load more results, please try again later
![](https://dblp1.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.
retrieved on 2024-07-03 06:17 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint