Michael Grimaila

Michael Grimaila

orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 February 2015 in IEEE Access
Verified
Journal Article
Open access
LMLogan O. Mailloux
Logan O. Mailloux
JMJeffrey D. Morris
Jeffrey D. Morris
MGMichael Grimaila
Michael Grimaila
DHDouglas D. Hodson
Douglas D. Hodson
DJDavid R. Jacques
David R. Jacques
JHJennifer A. Holes
Jennifer A. Holes
Quantum key distribution (QKD) is an innovative technology that exploits the laws of quantum mechanics to generate and distribute unconditionally secure shared key for use in cryptographic applications. However, QKD is a relatively nascent technology where real-world system implementations differ significantly from their ideal theoretical representations. In this paper, we introduce a modeling framework built upon the OMNeT++ discrete event simulation framework to study the impact of implementation nonidealities on QKD system performance and security. Specifically, we demonstrate the capability to study the device imperfections and practical engineering limitations through the modeling and simulation of a polarization-based, prepare and measure BB84 QKD reference architecture. The reference architecture allows users to model and study complex interactions between physical phenomenon and system-level behaviors representative of real-world design and implementation tradeoffs. Our results demonstrate the flexibility of the framework to simulate and evaluate current, future, and notional QKD protocols and components.

11 September 2013 in The Journal of Defense Modeling and Simulation: Applications, Methodology, Technology
Verified
Journal Article
Open access
JJJames S Johnson
James S Johnson
MGMichael Grimaila
Michael Grimaila
JHJeffrey W. Humphries
Jeffrey W. Humphries
GBGerald B Baumgartner
Gerald B Baumgartner
Quantum Key Distribution (QKD) is a revolutionary security technology that exploits the laws of quantum mechanics to achieve information-theoretic secure key exchange. QKD enables two parties to “grow” a shared secret key without placing any limits on an adversary’s computational power. Error reconciliation protocols have been developed that preserve security while allowing a sender and receiver to reconcile the errors in their respective keys. The most famous of these is the Cascade protocol, which is effective but suffers from a high communication complexity and low throughput. The Winnow protocol reduces the communication complexity over Cascade, but has the disadvantage of introducing errors. Finally, Low Density Parity Check (LDPC) codes have been shown to reconcile errors at rates higher than those of Cascade and Winnow, but with greater computational complexity. In this paper we evaluate the effectiveness of LDPC codes by comparing the runtime, throughput and communication complexity empirically with the Cascade and Winnow algorithms. The effects of inaccurate error estimation, non-uniform error distribution and varying key length on all three protocols are evaluated for identical input key strings. Analyses are performed on the results in order to characterize the strengths and weaknesses of each protocol.

19 November 2018 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
JOJames S. Okolica
James S. Okolica
GPGilbert L. Peterson
Gilbert L. Peterson
RMRobert F. Mills
Robert F. Mills
MGMichael Grimaila
Michael Grimaila
Sequence pattern mining (SPM) seeks to find multiple items that commonly occur together in a specific order. One common assumption is that the relevant differences between items are captured through creating distinct items. In some domains, this leads to an exponential increase in the number of items. This paper presents a new SPM, Sequence Mining of Temporal Clusters (SMTC), that allows item differentiation through attribute variables for domains with large numbers of items. It also provides a new technique for addressing interleaving, a phenomena that occurs when two sequences occur simultaneously resulting in their items alternating. By first clustering items temporally and only focusing on sequences after the temporal clusters are established, it sidesteps the traditional interleaving issues. SMTC is evaluated on a digital forensics dataset, a domain with a large number of items and frequent interleaving. Its results are compared with Discontinuous Varied Order Sequence Mining (DVSM) with variables added (DVSM-V). By adding variables, both algorithms reduce the data by 96%, and identify 100% of the events while keeping the false positive rate below 0.03%. SMTC mines the data in 20% of the time it takes DVSM-V and provides a lower false positive rate even at higher similarity thresholds.

12 August 2022 in The Journal of Supercomputing
Verified
Journal Article
Open access
PDF file
SBSarah Bolton
Sarah Bolton
RDRichard Dill
Richard Dill
MGMichael Grimaila
Michael Grimaila
DHDouglas Hodson
Douglas Hodson
Researchers typically increase training data to improve neural net predictive capabilities, but this method is infeasible when data or compute resources are limited. This paper extends previous research that used long short-term memory–fully convolutional networks to identify aircraft engine types from publicly available automatic dependent surveillance-broadcast (ADS-B) data. This research designs two experiments that vary the amount of training data samples and input features to determine the impact on the predictive power of the ADS-B classification model. The first experiment varies the number of training data observations from a limited feature set and results in 83.9% accuracy (within 10% of previous efforts with only 25% of the data). The findings show that feature selection and data quality lead to higher classification accuracy than data quantity. The second experiment accepted all ADS-B feature combinations and determined that airspeed, barometric pressure, and vertical speed had the most impact on aircraft engine type prediction.

1 April 2007
Verified
Conference Paper
Closed access
MGMichael Grimaila
Michael Grimaila
LFLarry W. Fortson
Larry W. Fortson
The use of computers and communication technologies to enhance command and control (C2) processes has yielded enormous benefits in military operations. Commanders are able to make higher quality decisions by accessing a greater number of information resources, obtaining more frequent updates from their information resources, and by correlation between, and across, multiple information resources to reduce uncertainty in the battlespace. However, these benefits do not come without a cost. The reliance on technology results in significant operational risk that is often overlooked and is frequently underestimated. In this research-in-progress paper, we discuss our initial findings in our efforts to improve the defensive cyber battle damage assessment process within US Air Force networks. We have found that the lack of a rigorous, well-documented, information asset-based risk management process results in significant uncertainty and delay when assessing the impact of an information incident.