default search action
Theo Fanuela Prabowo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Chik How Tan, Theo Fanuela Prabowo:
A new key recovery attack on a code-based signature from the Lyubashevsky framework. Inf. Process. Lett. 183: 106422 (2024) - [i3]Theo Fanuela Prabowo, Chik How Tan:
Concrete Analysis of Schnorr-type Signatures with Aborts. IACR Cryptol. ePrint Arch. 2024: 1256 (2024) - 2023
- [c10]Theo Fanuela Prabowo, Chik How Tan:
Attack on a Code-Based Signature Scheme from QC-LDPC Codes. C2SI 2023: 136-149 - [c9]Chik How Tan, Theo Fanuela Prabowo:
High Weight Code-Based Signature Scheme from QC-LDPC Codes. ICISC (1) 2023: 306-323 - 2022
- [j5]Ka Hin Leung, Theo Fanuela Prabowo:
Some nonexistence results for (v, m, k, pq)-strong external difference families. J. Comb. Theory A 187: 105575 (2022) - [c8]Theo Fanuela Prabowo, Chik How Tan:
Provably Secure Password-Authenticated Key Exchange Based on SIDH. WISA 2022: 16-28 - [i2]Jon-Lark Kim, Jihoon Hong, Terry Shue Chien Lau, YounJae Lim, Chik How Tan, Theo Fanuela Prabowo, Byung-Sun Won:
REDOG and Its Performance Analysis. IACR Cryptol. ePrint Arch. 2022: 1663 (2022) - 2021
- [j4]Terry Shue Chien Lau, Chik How Tan, Theo Fanuela Prabowo:
On the security of the modified Dual-ouroboros PKE using Gabidulin codes. Appl. Algebra Eng. Commun. Comput. 32(6): 681-699 (2021) - [j3]Ka Hin Leung, Shuxing Li, Theo Fanuela Prabowo:
Nonexistence of strong external difference families in abelian groups of order being product of at most three primes. J. Comb. Theory A 178: 105338 (2021) - 2020
- [c7]Chik How Tan, Theo Fanuela Prabowo:
Error-Free Lattice-Based Key Encapsulation Mechanism Based on Ring-LWE. FPS 2020: 163-179
2010 – 2019
- 2019
- [c6]Terry Shue Chien Lau, Chik How Tan, Theo Fanuela Prabowo:
Key Recovery Attacks on Some Rank Metric Code-Based Signatures. IMACC 2019: 215-235 - [i1]Terry Shue Chien Lau, Chik How Tan, Theo Fanuela Prabowo:
Analysis of TPL Signature Scheme. IACR Cryptol. ePrint Arch. 2019: 303 (2019) - 2018
- [j2]Qichun Wang, Chik How Tan, Theo Fanuela Prabowo:
On the covering radius of the third order Reed-Muller code RM(3, 7). Des. Codes Cryptogr. 86(1): 151-159 (2018) - [c5]Theo Fanuela Prabowo, Chik How Tan:
Almost Orthogonal MDS Matrices over GR(2n, k). ISIT 2018: 2416-2420 - [c4]Chik How Tan, Theo Fanuela Prabowo, Terry Shue Chien Lau:
Rank Metric Code-based Signature. ISITA 2018: 70-74 - 2017
- [c3]Theo Fanuela Prabowo, Chik How Tan:
Generating Complete Edwards Curves. ACISP (2) 2017: 335-348 - [c2]Chik How Tan, Theo Fanuela Prabowo:
Orthogonal MDS Diffusion Matrices over Galois Rings. IMACC 2017: 307-330 - 2016
- [j1]Chik How Tan, Theo Fanuela Prabowo, Duc-Phong Le:
Breaking an ID-based encryption based on discrete logarithm and factorization problems. Inf. Process. Lett. 116(2): 116-119 (2016) - [c1]Theo Fanuela Prabowo, Chik How Tan:
Implicit Quadratic Property of Differentially 4-Uniform Permutations. INDOCRYPT 2016: 364-379
Coauthor Index
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-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint