English
Related papers

Related papers: Pairing-Friendly Elliptic Curves: Revisited Taxono…

200 papers

With the emergence of data silos and popular privacy awareness, the traditional centralized approach of training artificial intelligence (AI) models is facing strong challenges. Federated learning (FL) has recently emerged as a promising…

Cryptography and Security · Computer Science 2020-03-05 Lingjuan Lyu , Han Yu , Qiang Yang

Consider the elliptic curves given by $ E_{n,\theta}:\quad y^2=x^3+2s n x^2-(r^2-s^2) n^2 x $ where $0 < \theta< \pi$, $\cos(\theta)=s/r$ is rational with $0\leq |s| <r$ and $\gcd (r,s)=1$. These elliptic curves are related to the…

Number Theory · Mathematics 2014-12-16 Ali S. Janfada , Sajad Salami , andrej Dujella , Juan C. Peral

Recent studies on the safety alignment of large language models (LLMs) have revealed that existing approaches often operate superficially, leaving models vulnerable to various adversarial attacks. Despite their significance, these studies…

Cryptography and Security · Computer Science 2025-06-02 Jianwei Li , Jung-Eun Kim

We introduce a new methodology dubbed ``safe peeling'' to accelerate the resolution of L0-regularized least-squares problems via a Branch-and-Bound (BnB) algorithm. Our procedure enables to tighten the convex relaxation considered at each…

Machine Learning · Computer Science 2023-06-07 Théo Guyard , Gilles Monnoyer , Clément Elvira , Cédric Herzet

Whilst many key exchange and digital signature methods use the NIST P256 (secp256r1) and secp256k1 curves, there is often a demand for increased security. With these curves, we have a 128-bit security. These security levels can be increased…

Cryptography and Security · Computer Science 2026-04-21 Víctor Duarte Melo , William J. Buchanan

We study probabilistic safety for Bayesian Neural Networks (BNNs) under adversarial input perturbations. Given a compact set of input points, $T \subseteq \mathbb{R}^m$, we study the probability w.r.t. the BNN posterior that all the points…

Machine Learning · Computer Science 2020-06-22 Matthew Wicker , Luca Laurenti , Andrea Patane , Marta Kwiatkowska

Let $k=2^mp^n$ for an odd prime $p$ and integers $m\ge 0$ and $n\ge 0$. We obtain lower bounds for the $\rho$-values of cyclotomic families of pairing-friendly elliptic curves with embedding degree $k$ and $r(x)=\Phi_k(x)$. Our bounds imply…

Number Theory · Mathematics 2014-04-18 Min Sha

Some geometry on non-singular cubic curves, mainly over finite fields, is surveyed. Such a curve has 9,3,1 or 0 points of inflexion, and cubic curves are classified accordingly. The group structure and the possible numbers of rational…

Number Theory · Mathematics 2011-07-25 A. A. Bruen , J. W. P. Hirschfeld , D. L. Wehlau

Bit Flip Attacks (BFAs) are a well-established class of adversarial attacks, originally developed for Convolutional Neural Networks within the computer vision domain. Most recently, these attacks have been extended to target Graph Neural…

Machine Learning · Computer Science 2025-04-21 Lorenz Kummer , Samir Moustafa , Wilfried Gansterer , Nils Kriege

Protecting the privacy of blockchain transactions is extremely important for users. Stealth address protocols (SAP) allow users to receive assets via stealth addresses that they do not associate with their stealth meta-addresses. SAP can be…

Cryptography and Security · Computer Science 2024-09-17 Marija Mikic , Mihajlo Srbakoski

We present a general framework for constructing families of elliptic curves of prime order with prescribed embedding degree. We demonstrate this method by constructing curves with embedding degree k = 10, which solves an open problem posed…

Number Theory · Mathematics 2007-05-23 David Freeman

Elliptic curve cryptography (ECC) is foundational to modern secure communication, yet existing standard curves have faced scrutiny for opaque parameter-generation practices. This work introduces a Selmer-inspired framework for constructing…

Cryptography and Security · Computer Science 2025-10-06 Awnon Bhowmik

The Survivable Network Design problem (SNDP) is a well-studied problem, motivated by the design of networks that are robust to faults under the assumption that any subset of edges up to a specific number can fail. We consider non-uniform…

Data Structures and Algorithms · Computer Science 2024-03-26 Chandra Chekuri , Rhea Jain

A set S of vertices of a graph is a defensive alliance if, for each element of S, the majority of its neighbors is in S. The problem of finding a defensive alliance of minimum size in a given graph is NP-hard and there are polynomial-time…

Computational Complexity · Computer Science 2017-07-17 Bernhard Bliem , Stefan Woltran

Personalization collaborative filtering recommender systems (CFRSs) are the crucial components of popular e-commerce services. In practice, CFRSs are also particularly vulnerable to "shilling" attacks or "profile injection" attacks due to…

Information Retrieval · Computer Science 2015-06-24 Zhihai Yang

There has been a lot of effort to construct good quantum codes from the classical error correcting codes. Constructing new quantum codes, using Hermitian self-orthogonal codes, seems to be a difficult problem in general. In this paper,…

Information Theory · Computer Science 2021-12-14 Lin Sok

The last few years have seen an increasing wave of attacks with serious economic and privacy damages, which evinces the need for accurate Network Intrusion Detection Systems (NIDS). Recent works propose the use of Machine Learning (ML)…

Cryptography and Security · Computer Science 2021-08-02 David Pujol-Perich , José Suárez-Varela , Albert Cabellos-Aparicio , Pere Barlet-Ros

Neural networks are increasingly deployed in real-world safety-critical domains such as autonomous driving, aircraft collision avoidance, and malware detection. However, these networks have been shown to often mispredict on inputs with…

Machine Learning · Computer Science 2018-11-09 Shiqi Wang , Kexin Pei , Justin Whitehouse , Junfeng Yang , Suman Jana

In the NP-hard Edge Dominating Set problem (EDS) we are given a graph $G=(V,E)$ and an integer $k$, and need to determine whether there is a set $F\subseteq E$ of at most $k$ edges that are incident with all (other) edges of $G$. It is…

Data Structures and Algorithms · Computer Science 2019-01-14 Eva-Maria C. Hols , Stefan Kratsch

In the past two decades, Elliptic Curve Cryptography (ECC) have become increasingly advanced. ECC, with much smaller key sizes, offers equivalent security when compared to other asymmetric cryptosystems. In this survey, an comprehensive…

Signal Processing · Electrical Eng. & Systems 2017-10-24 Bahram Rashidi