Advanced search
Publication Cover
Experimental Mathematics Volume 1, 1992 - Issue 2
Submit an article Journal homepage
13
Views
36
CrossRef citations to date
0
Altmetric
Original Articles

Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes

Carl Pomerance Department of Mathematics, University of Georgia, Athens, GA, 30602 E-mail: [email protected]
&
J. W. Smith Department of Computer Science, University of Georgia, Athens, GA, 30602 E-mail: [email protected]
Pages 89-94 | Published online: 03 Apr 2012

Citations (36)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (1)

Rahul Janga, R. Padmavathy, S. K. Pal & S. Ravichandra. (2023) A Framework for Filtering Step of Number Field Sieve and Function Field Sieve. IETE Journal of Research 69:6, pages 3317-3333.
Read now

Articles from other publishers (35)

David W. H. A. da Silva, Carlos Paz de Araujo, Edward Chow & Bryan Sosa Barillas. (2019) A New Approach Towards Fully Homomorphic Encryption Over Geometric Algebra. A New Approach Towards Fully Homomorphic Encryption Over Geometric Algebra.
Ye Li, Shibing Zhang, Jue Wang, Xiaodong Ji, Huangnan Wu & Zhihua Bao. (2018) A Low-Complexity Coded Transmission Scheme Over Finite-Buffer Relay Links. IEEE Transactions on Communications 66:7, pages 2873-2887.
Crossref
Shenghao Yang, Tsz-Ching Ng & Raymond W. Yeung. (2018) Finite-Length Analysis of BATS Codes. IEEE Transactions on Information Theory 64:1, pages 322-348.
Crossref
Shenghao Yang & Raymond W. Yeung. (2017) BATS Codes: Theory and Practice. Synthesis Lectures on Communication Networks 10:2, pages 1-226.
Crossref
A. Ravali & K Sangeeta. (2017) On the reduction of large sparse matrices. On the reduction of large sparse matrices.
Ye Li, Wai-Yip Chan & Steven D. Blostein. (2017) On Design and Efficient Decoding of Sparse Random Linear Network Codes. IEEE Access 5, pages 17031-17044.
Crossref
Hamza Jeljeli. 2015. Arithmetic of Finite Fields. Arithmetic of Finite Fields 25 44 .
Kazuhisa Matsuzono, Vincent Roca & Hitoshi Asaeda. (2014) Structured random linear codes (SRLC): Bridging the gap between block and convolutional codes. Structured random linear codes (SRLC): Bridging the gap between block and convolutional codes.
Shenghao Yang & Raymond W. Yeung. (2014) Batched Sparse Codes. IEEE Transactions on Information Theory 60:9, pages 5322-5346.
Crossref
Heliang Huang, Wansu Bao & Shukai Liu. (2014) Parallel Gaussian elimination for XL family over GF(2). Security and Communication Networks 7:3, pages 503-510.
Crossref
Hamza Jeljeli. 2014. Euro-Par 2014 Parallel Processing. Euro-Par 2014 Parallel Processing 764 775 .
Vincent Roca, Mathieu Cunche, Cedric Thienot, Jonathan Detchart & Jerome Lacan. (2013) RS + LDPC-Staircase codes for the erasure channel: Standards, usage and performance. RS + LDPC-Staircase codes for the erasure channel: Standards, usage and performance.
Kenichiro Hayasaka, Kazumaro Aoki, Tetsutaro Kobayashi & Tsuyoshi Takagi. 2013. ‘. ‘ 108 120 .
Kenichiro Hayasaka & Tsuyoshi Takagi. 2011. Coding and Cryptology. Coding and Cryptology 191 200 .
Arjen K. Lenstra. 2011. Encyclopedia of Cryptography and Security. Encyclopedia of Cryptography and Security 611 618 .
Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shin’ichiro Matsuo, Masaaki Shirase & Tsuyoshi Takagi. 2010. Public Key Cryptography – PKC 2010. Public Key Cryptography – PKC 2010 351 367 .
Martin Kreuzer. (2009) Algebraic Attacks Galore!. Groups – Complexity – Cryptology 1:2.
Crossref
Amin Shokrollahi. 2009. Mathknow. Mathknow 59 89 .
Daniel Andrén, Lars Hellström & Klas Markström. (2007) On the complexity of matrix reduction over finite fields. Advances in Applied Mathematics 39:4, pages 428-452.
Crossref
R. Granger, A. J. Holt, D. Page, N. P. Smart & F. Vercauteren. 2004. Algorithmic Number Theory. Algorithmic Number Theory 223 234 .
Andrew J. Holt & James H. Davenport. 2003. Cryptography and Coding. Cryptography and Coding 207 222 .
Emmanuel Thomé. (2002) Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm. Journal of Symbolic Computation 33:5, pages 757-775.
Crossref
Emmanuel Thomé. 2001. Advances in Cryptology — ASIACRYPT 2001. Advances in Cryptology — ASIACRYPT 2001 107 124 .
Andrew Odlyzko. 2000. Towards a Quarter-Century of Public Key Cryptography. Towards a Quarter-Century of Public Key Cryptography 59 75 .
Arjen K. Lenstra. 2000. Towards a Quarter-Century of Public Key Cryptography. Towards a Quarter-Century of Public Key Cryptography 31 58 .
Stefania Cavallar. 2000. Algorithmic Number Theory. Algorithmic Number Theory 209 231 .
Edward A Bender & E.Rodney Canfield. (1999) An Approximate Probabilistic Model for Structured Gaussian Elimination. Journal of Algorithms 31:2, pages 271-290.
Crossref
Erich Kaltofen. (1995) Analysis of Coppersmith’s block Wiedemann algorithm for the parallel solution of sparse linear systems. Mathematics of Computation 64:210, pages 777-777.
Crossref
Derek Atkins, Michael Graff, Arjen K. Lenstra & Paul C. Leyland. 1995. Advances in Cryptology — ASIACRYPT'94. Advances in Cryptology — ASIACRYPT'94 261 277 .
Carl Pomerance. 1995. Proceedings of the International Congress of Mathematicians. Proceedings of the International Congress of Mathematicians 411 422 .
Bruce Dodson & Arjen K. Lenstra. 1995. Advances in Cryptology — CRYPT0’ 95. Advances in Cryptology — CRYPT0’ 95 372 385 .
Arjen K. Lenstra. 1994. Distributed Algorithms. Distributed Algorithms 28 38 .
T. Denny, B. Dodson, A. K. Lenstra & M. S. Manasse. 1994. Advances in Cryptology — CRYPTO’ 93. Advances in Cryptology — CRYPTO’ 93 166 174 .
A. K. Lenstra, H. W. Lenstra, M. S. Manasse & J. M. Pollard. (1993) The factorization of the ninth Fermat number. Mathematics of Computation 61:203, pages 319-349.
Crossref
A. K. Lenstra, H. W. Lenstra, M. S. Manasse & J. M. Pollard. 1993. The development of the number field sieve. The development of the number field sieve 11 42 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.