Open AccessJournal Article
Data Structure and Algorithm for Large-Scale Generalized Assignment Problem with Considering Priority Order
1
About: This article is published in Transactions of the Institute of electronics, information and communication engineers. The article was published on 01 Feb 2002. and is currently open access. The article focuses on the topics: Generalized assignment problem & Deadline-monotonic scheduling.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Fast Large Integer Modular Addition in GF(p) Using Novel Attribute-Based Representation
Bader Alhazmi,Fayez Gebali +1 more
TL;DR: A novel and efficient attribute-based large integer representation scheme suitable for large integers commonly used in cryptography such as the five NIST primes and the Pierpont primes used in supersingular isogeny Diffie–Hellman (SIDH) for post-quantum cryptography is proposed.
References
Fast Large Integer Modular Addition in GF(p) Using Novel Attribute-Based Representation
Bader Alhazmi,Fayez Gebali +1 more
TL;DR: A novel and efficient attribute-based large integer representation scheme suitable for large integers commonly used in cryptography such as the five NIST primes and the Pierpont primes used in supersingular isogeny Diffie–Hellman (SIDH) for post-quantum cryptography is proposed.
Related Papers (5)
Silvano Martello,Paolo Toth +1 more
- 01 Jan 1981
Jayanta Majumdar,Asoke Kumar Bhunia +1 more
- 01 Jan 2006