Bibliography [ABD16] ▇▇▇▇▇▇ ▇▇▇▇▇▇▇▇, ▇▇▇ ▇▇▇, and ▇▇▇ ▇▇▇▇▇. A subfield lattice attack on overstretched NTRU assumptions. In: Springer, 2016, pages 153–178. [AD21] ▇▇▇▇▇▇ ▇▇▇▇▇▇▇▇ and ▇▇▇ ▇▇▇▇▇. Lattice Attacks on NTRU and LWE: A History of Refinements. In: Compu- tational Cryptography: Algorithmic Aspects of Cryptol- ogy. London Mathematical Society Lecture Note Series. Cambridge University Press, 2021, pages 15–40. [ADPS16] ▇▇▇▇▇ ▇▇▇▇▇, ▇▇▇ ▇▇▇▇▇, ▇▇▇▇▇▇ ▇▇▇▇▇▇▇▇▇▇, and Pe- ter ▇▇▇▇▇▇▇. Post-quantum Key Exchange–A New Hope. In: 2016, pages 327–343. [AEN19] ▇▇▇▇▇▇▇▇▇ ▇▇▇▇, ▇▇▇▇▇▇ ▇▇▇▇▇▇▇, and ▇▇▇▇▇ ▇. ▇▇▇▇▇▇. Random Lattices: Theory And Practice. Available at ▇▇▇▇▇://▇▇▇▇▇▇▇.▇▇▇▇▇▇.▇▇/bin/random_lattice. pdf. 2019. [AFG13] ▇▇▇▇▇▇ ▇. ▇▇▇▇▇▇▇▇, ▇▇▇▇▇▇ ▇▇▇▇▇▇▇▇▇▇▇, and ▇▇▇▇▇▇▇ ▇▇▇▇▇▇▇. On the efficacy of solving LWE by reduction to unique-SVP. In: Springer, 2013, pages 293–310. [AGPS20] ▇▇▇▇▇▇ ▇. ▇▇▇▇▇▇▇▇, ▇▇▇▇ ▇▇▇▇▇▇▇▇▇, ▇▇▇▇▇▇ ▇. ▇▇▇▇▇▇▇▇▇▇▇▇▇, and ▇▇▇▇ ▇. ▇▇▇▇▇▇▇. Estimating quan- tum speedups for lattice sieves. In: Springer, 2020, pages 583–613. [AGVW17] ▇▇▇▇▇▇ ▇. ▇▇▇▇▇▇▇▇, ▇▇▇▇▇▇▇ ▇▇▇▇▇▇▇, ▇▇▇▇▇▇▇▇ ▇▇▇▇▇▇, and ▇▇▇▇▇▇ ▇▇▇▇▇▇▇▇. Revisiting the expected cost of solving uSVP and applications to LWE. In: International Conference on the Theory and Application of Cryptology and Information Security. Springer. 2017, pages 297–322. [Ajt99] ▇▇▇▇▇▇ ▇▇▇▇▇. Generating Hard Instances of the Short Basis Problem. In: ICALP. 1999, pages 1–9. [AKS01] ▇▇▇▇▇▇ ▇▇▇▇▇, ▇▇▇▇ ▇▇▇▇▇, and ▇. ▇▇▇▇▇▇▇▇▇. A sieve algorithm for the shortest lattice vector problem. In: STOC. 2001, pages 601–610. [AL22] ▇▇▇▇▇▇ ▇. ▇▇▇▇▇▇▇▇ and ▇▇▇▇▇▇▇ ▇▇. Predicting BKZ Z- Shapes on q-ary Lattices. Cryptology ePrint Archive, Re- port 2022/843. 2022. [Alb+15] ▇▇▇▇▇▇ ▇. ▇▇▇▇▇▇▇▇, ▇▇▇▇▇▇ ▇▇▇, ▇▇▇▇-▇▇▇▇▇▇▇ ▇▇▇▇▇▇▇, ▇▇▇▇▇▇ ▇▇▇▇▇▇▇▇▇▇▇, and ▇▇▇▇▇▇▇ ▇▇▇▇▇▇. On the complex- ity of the BKW algorithm on LWE. In: Designs, Codes and Cryptography 74.2 (2015), pages 325–354. [Alb+19] ▇▇▇▇▇▇ ▇. ▇▇▇▇▇▇▇▇, ▇▇▇ ▇▇▇▇▇, ▇▇▇▇▇▇▇▇▇ ▇▇▇▇▇▇, ▇▇▇▇▇ ▇▇▇▇▇▇▇▇▇▇, ▇▇▇▇▇▇ ▇ ▇▇▇▇▇▇▇▇▇▇▇▇▇, and ▇▇▇▇ ▇▇▇▇▇▇▇. The general sieve kernel and new records in lattice reduction. In: Annual International Conference on the Theory and Applications of Cryptographic Tech- niques. Springer. 2019, pages 717–746. [ALL19] ▇▇▇▇▇▇▇ ▇▇▇▇▇▇, ▇▇▇▇▇▇ ▇▇▇▇▇▇▇▇▇▇, and ▇▇▇▇▇▇▇▇ ▇▇▇▇▇▇▇▇. Decoding Challenge. Available at http : / / ▇▇▇▇▇▇▇▇▇▇▇▇▇▇▇▇▇.▇▇▇. 2019. [AN17] ▇▇▇▇▇▇▇▇▇ ▇▇▇▇ and ▇▇▇▇▇ ▇. ▇▇▇▇▇▇. Random ▇▇▇- ▇▇▇▇▇ revisited: lattice enumeration with discrete prun- ing. In: Eurocrypt. 2017, pages 65–102. [ANS18] ▇▇▇▇▇▇▇▇▇ ▇▇▇▇, ▇▇▇▇▇ ▇. ▇▇▇▇▇▇, and ▇▇▇▇▇ ▇▇▇▇. Quantum lattice enumeration and tweaking discrete pruning. In: Asiacrypt. 2018, pages 405–434. [AP11] ▇▇▇▇ ▇▇▇▇▇ and ▇▇▇▇▇ ▇▇▇▇▇▇▇. Generating Shorter Bases for Hard Random Lattices. In: Theory of Computing Sys- tems 48.3 (Apr. 2011). Preliminary version in STACS 2009, pages 535–553. [AR05] ▇▇▇▇▇ ▇▇▇▇▇▇▇▇ and ▇▇▇▇ ▇▇▇▇▇. Lattice problems in NP coNP. In: J. ACM 52.5 (2005). Preliminary version in FOCS 2004, pages 749–765. [AUV19] ▇▇▇▇▇▇ ▇▇▇▇▇▇▇▇, ▇▇▇▇▇▇ ▇▇▇▇, and ▇▇▇▇▇ ▇▇▇▇▇▇▇▇. Faster sieving algorithm for approximate SVP with con- stant approximation factors. Cryptology ePrint Archive, Report 2019/1028. 2019. [AWHT16] ▇▇▇▇▇▇▇▇▇ ▇▇▇▇, ▇▇▇▇▇▇ ▇▇▇▇, ▇▇▇▇▇▇ ▇▇▇▇▇▇▇, and ▇▇▇▇▇▇▇▇ ▇▇▇▇▇▇. Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator. In: Springer, 2016, pages 789–819. [Bab16] ▇▇▇▇▇▇ ▇▇▇▇▇. Graph isomorphism in quasipolynomial time. In: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing. 2016, pages 684– 697. [Bab19] ▇▇▇▇▇▇ ▇▇▇▇▇. Canonical form for graphs in quasipolyno- mial time: preliminary report. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Com- puting. 2019, pages 1237–1246. [Bab86] ▇▇▇▇▇▇ ▇▇▇▇▇. On ▇▇▇▇▇▇’ lattice reduction and the near- est lattice point problem. In: Combinatorica 6.1 (1986). Preliminary version in STACS 1985, pages 1–13.
General References All references in this Supplemental Indenture to Articles and Sections, unless otherwise specified, refer to the corresponding Articles and Sections of this Supplemental Indenture; and the term “herein”, “hereof”, “hereunder” and any other word of similar import refers to this Supplemental Indenture.
Cross-References Unless otherwise specified, references in this Agreement and in each other Loan Document to any Article or Section are references to such Article or Section of this Agreement or such other Loan Document, as the case may be, and, unless otherwise specified, references in any Article, Section or definition to any clause are references to such clause of such Article, Section or definition.
Captions and Cross References The various captions (including the table of contents) in this Agreement are provided solely for convenience of reference and shall not affect the meaning or interpretation of any provision of this Agreement. Unless otherwise indicated, references in this Agreement to any Section, Schedule or Exhibit are to such Section Schedule or Exhibit to this Agreement, as the case may be, and references in any Section, subsection, or clause to any subsection, clause or subclause are to such subsection, clause or subclause of such Section, subsection or clause.
Tariff References 3.5.1 References to state tariffs throughout this Agreement shall be to the currently effective tariff for the state or jurisdiction in which the services were provisioned; provided however, where certain AT&T-21STATE services or tariff provisions have been or become deregulated or detariffed, any reference in this Agreement to a detariffed or deregulated service or provision of such tariff shall be deemed to refer to the service description, price list or other agreement pursuant to which AT&T-21STATE provides such services as a result of detariffing or deregulation. 3.5.2 Wherever the term “customer” is used in connection with AT&T-21STATE’s retail tariffs, the term “customer” means the ultimate consumer or the End User of any tariffed service. 3.5.3 No reference to tariffs in this Agreement shall be interpreted or construed as permitting CLEC to purchase Interconnection Services, under such tariff. Except where expressly permitted elsewhere in this Agreement, notwithstanding the availability of Interconnection Services under tariffs in some AT&T-21STATE incumbent ILEC states, CLEC agrees that any purchase of Interconnection Services addressed by this Agreement or required to be offered by AT&T-21STATE under Section 251 of the Act, shall be purchased solely pursuant to the terms, condition and rates set forth in this Agreement. To the extent that complete terms, conditions and/or rates for any Interconnection Service are not contained in this Agreement at the time CLEC seeks to order such services, the Parties shall amend this Agreement to include such terms, conditions and rates prior to CLEC submitting such order. The rates for Interconnection Services inadvertently or improperly ordered prior to an agreement of the Parties on terms, conditions and/or rates is addressed in the Pricing Schedule.