Gregory V. Bard

According to our database, Gregory V. Bard authored at least 27 papers between 2004 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Determining whether a given cryptographic function is a permutation of another given cryptographic function - A problem in intellectual property.

Gregory V. Bard

Theor. Comput. Sci., 2019

The CATS Hackathon: Creating and Refining Test Items for Cybersecurity Concept Inventories.

Alan T. Sherman, Josiah Dykstra, Gregory V. Bard, Ankur Chattopadhyay, Filipo Sharevski, Rakesh M. Verma, Ryan Vrecenar, Linda Oliva, Enis Golaszewski, Dhananjay S. Phatak, Travis Scheponik, Geoffrey L. Herman, Dong San Choi, Spencer E. Offenberger, Peter Peterson

IEEE Secur. Priv., 2019

2015

Plaintext recovery for one-time pads used twice.

Gregory V. Bard, Theodore McDonnough

ACM Commun. Comput. Algebra, 2015

2012

Statistics of Random Permutations and the Cryptanalysis of Periodic Block Ciphers.

Gregory V. Bard, Shaun Van Ault, Nicolas T. Courtois

Cryptologia, 2012

Error Bounds on Derivatives during Simulations

Gregory Bard, Alexander Basyrov

CoRR, 2012

Random Permutation Statistics and an Improved Slide-Determine Attack on KeeLoq.

Nicolas T. Courtois, Gregory V. Bard

Proceedings of the Cryptography and Security: From Theory to Applications, 2012

2011

Efficient Dense Gaussian Elimination over the Finite Field with Two Elements

Martin R. Albrecht, Gregory V. Bard, Clément Pernet

CoRR, 2011

A New General-Purpose Method to Multiply 3x3 Matrices Using Only 23 Multiplications

Nicolas T. Courtois, Gregory V. Bard, Daniel Hulme

CoRR, 2011

SAT Over BOINC: An Application-Independent Volunteer Grid Project.

Michael Black, Gregory Bard

Proceedings of the 12th IEEE/ACM International Conference on Grid Computing, 2011

2010

Algorithm 898: Efficient multiplication of dense matrices over GF(2).

Martin R. Albrecht, Gregory V. Bard, William Hart

ACM Trans. Math. Softw., 2010

Improved Algebraic Cryptanalysis of QUAD, Bivium and Trivium via Graph Partitioning on Equation Systems.

Kenneth Koon-Ho Wong, Gregory V. Bard

IACR Cryptol. ePrint Arch., 2010

Abstract only: DEMOCRACY: a heuristic for polynomial systems of equations over finite fields.

Gregory V. Bard

ACM Commun. Comput. Algebra, 2010

Algebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers.

Gregory V. Bard, Nicolas T. Courtois, Jorge Nakahara Jr., Pouyan Sepehrdad, Bingsheng Zhang

Proceedings of the Progress in Cryptology - INDOCRYPT 2010, 2010

2009

Partitioning Multivariate Polynomial Equations via Vertex Separators for Algebraic Cryptanalysis and Mathematical Applications.

Kenneth Koon-Ho Wong, Gregory V. Bard, Robert H. Lewis

IACR Cryptol. ePrint Arch., 2009

The Application of Polynomials over the Field of Two Elements to a Problem in Intellectual Property.

Gregory V. Bard

IACR Cryptol. ePrint Arch., 2009

2008

Efficient Multiplication of Dense Matrices over GF(2)

Martin R. Albrecht, Gregory V. Bard, William Hart

CoRR, 2008

2007

Algorithms for Solving Linear and Polynomial Systems of Equations over Finite Fields with Applications to Cryptanalysis.

Gregory V. Bard

PhD thesis, 2007

Algebraic and Slide Attacks on KeeLoq.

Nicolas T. Courtois, Gregory V. Bard, David A. Wagner

IACR Cryptol. ePrint Arch., 2007

Efficient Methods for Conversion and Solution of Sparse Systems of Low-Degree Multivariate Polynomials over GF(2) via SAT-Solvers.

Gregory V. Bard, Nicolas T. Courtois, Chris Jefferson

IACR Cryptol. ePrint Arch., 2007

Blockwise-Adaptive Chosen-Plaintext Attack and Online Modes of Encryption.

Gregory V. Bard

Proceedings of the Cryptography and Coding, 2007

2006

Algebraic Cryptanalysis of the Data Encryption Standard.

Nicolas T. Courtois, Gregory V. Bard

IACR Cryptol. ePrint Arch., 2006

Spelling-Error Tolerant, Order-Independent Pass-Phrases via the Damerau-Levenshtein String-Edit Distance Metric.

Gregory V. Bard

IACR Cryptol. ePrint Arch., 2006

Modes of Encryption Secure against Blockwise-Adaptive Chosen-Plaintext Attack.

Gregory V. Bard

IACR Cryptol. ePrint Arch., 2006

Accelerating Cryptanalysis with the Method of Four Russians.

Gregory V. Bard

IACR Cryptol. ePrint Arch., 2006

Achieving a log(n) Speed Up for Boolean Matrix Operations and Calculating the Complexity of the Dense Linear Algebra step of Algebraic Stream Cipher Attacks and of Integer Factorization Methods.

Gregory V. Bard

IACR Cryptol. ePrint Arch., 2006

A Challenging but Feasible Blockwise-Adaptive Chosen-Plaintext Attack on SSL.

Gregory V. Bard

IACR Cryptol. ePrint Arch., 2006

2004

The Vulnerability of SSL to Chosen Plaintext Attack.

Gregory V. Bard

IACR Cryptol. ePrint Arch., 2004