Malicious JavaScript detection using machine learning models has shown many great results over the years. However, real-world data only has a small fraction of malicious JavaScript, making it an imbalanced dataset. Many of the previous techniques ignore most of the benign samples and focus on training a machine learning model with a balanced dataset. This paper proposes a Doc2Vec-based filter model that can quickly classify JavaScript malware using Natural Language Processing (NLP) and feature re-sampling. The feature of the JavaScript file will be converted into vector form and used to train the classifiers. Doc2Vec, a NLP model used for documents is used to create feature vectors from the datasets. In this paper, the total features of the benign samples will be reduced using a combination of word vector and clustering model. Random seed oversampling will be used to generate new training malicious data based on the original training dataset. We evaluate our models with a dataset of over 30,000 samples obtained from top popular websites, PhishTank, and GitHub. The experimental result shows that the best f1-score achieves at 0.99 with the MLP classifier.
Recently, it was shown that the Chudnovsky-type algorithms over the projective line enable a generic recursive construction of multiplication algorithms in finite fields $$\mathbb {F}_{q^n}$$ . This construction is based on the method introduced by D. V. and G. V. Chudnovsky (1987), that generalizes polynomial interpolation to the use of algebraic curves, and specialized to the case of the projective line. More precisely, using evaluation at places of increasing degrees of the rational function field over $$\mathbb {F}_q$$ , it has been proven that one can construct in polynomial time algorithms with a quasi-linear bilinear complexity with respect to the extension degree n. In this paper, we discuss how the use of evaluation with multiplicity, using generalized evaluation maps, can improve this construction.
Research on codes over finite rings has intensified after the discovery that some of the best binary nonlinear codes can be obtained as images of ℤ_4 -linear codes. Codes over various finite rings have been a subject of much research in coding theory after this discovery. Many of these rings are extensions of ℤ_4 and numerous new linear codes over ℤ_4 have been found in the last decade. Due to the special place of ℤ_4 , an online database of ℤ_4 codes was created in 2007. The original database on ℤ_4 codes recently became unavailable. The purpose of this paper is to introduce a new and updated database of ℤ_4 codes. We have made major updates to the original database by adding 8699 new linear codes over ℤ_4 . These codes have been found through exhaustive computer searches on cyclic codes and by an implementation of the ASR search algorithm that has been remarkably fruitful to obtain new linear codes from the class of quasi-cyclic (QC) and quasi-twisted (QT) codes over finite fields. We made modifications to the ASR algorithm to make it work over ℤ_4 . The initial database contained few codes that were not free. We have now added a large number of non-free codes. In fact, of the 8699 codes we have added, 7631 of them are non-free. Our database will be further updated by incorporating data from [16]. We also state an open problem of great theoretical interest that arose from computational observations.
As the development of quantum machines is booming and would threaten our standard cryptography algorithms, a transition period is necessary for the protection of the data processed by our classical machines as well before the arrival of theses machines as after. Recently, to get ahead of the curve, the National Institute of Standards and Technology (NIST) launched the Post Quantum Cryptography Standardization Project, started since late 2016. Among finalists, 3 promising code-theoretic finalist candidates, Classic McEliece, BIKE, and HQC are sent to the fourth round. In this work, to reduce classical McEliece key size without loss of security, we present a new key generation algorithm by introducing new family of codes called quasi-centrosymmetric Goppa codes with a moderate key size for storage optimisation. We also have characterized these codes in the case where the parity matrix is in Cauchy form by giving an algorithm to build them. We ended up giving a detailed analysis of the security against the most known structural attacks by giving the new complexities.
QCB is a proposal for a post-quantum secure, rate-one authenticated encryption with associated data scheme (AEAD) based on classical OCB3 and CB, which are vulnerable against a quantum adversary in the Q2 setting. The authors of QCB prove integrity under plus-one unforgeability, whereas the proof of the stronger definition of blind unforgeability has been left as an open problem. After a short overview of QCB and the current state of security definitions for authentication, this work proves blind unforgeability of QCB. Finally, the strategy of using tweakable block ciphers in authenticated encryption is generalised to a generic blindly unforgeable AEAD model.
