Conhecimento da Lingua O Contratado, pelo presente instrumento, declara expressamente que tem pleno conhecimento da língua inglesa e que leu, compreendeu e livremente aceitou e concordou com os termos e condições estabelecidas no Plano e no Acordo de Atribuição (“Agreement” ▇▇ ▇▇▇▇▇▇).
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.
SAMPLE (If applicable and the project has specifications, insert the specifications into this section.)
Images If applicable, the CONSULTANT is prohibited from capturing on any visual medium images of any property, logo, student, or employee of the DISTRICT, or any image that represents the DISTRICT without express written consent from the DISTRICT.
Women’s Advocate The Parties recognize that Employees may sometimes need to discuss matters such as violence or abuse at home or workplace harassment and may feel more comfortable doing so with a female peer. They may also need to learn about specialized resources in the community, such as counsellors or women’s shelters, to assist them in dealing with any issues that may arise. For these reasons, the Parties agree to recognize that the role of Women’s Advocate in the workplace will be served by a Unifor Local 5555 female member selected by Unifor. The Women’s Advocate will meet with Employees as required to discuss problems and refer them to the appropriate agency when necessary. The Women’s Advocate will participate in an annual 3-day training conference in accordance with Article 28.01(a). The Women’s Advocate shall be given release from their regular duties as required without loss of regular pay and benefits. The amount of time required for release and the cost allocations are subject to review and agreement by the Employer and the Union. On or before December 1 of each year, Unifor will provide a detailed report to the University’s Management Liaison to the Women’s Advocate, accounting for the specific activities of the Women’s Advocate over the previous 12 months, including: i. the total number of Employees they have assisted; ii. the specific dates and times for which they have been granted release time as the Women’s Advocate; iii. an aggregate summary of the matters they have handled; and iv. an aggregate summary of the referrals they have made.